检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

250 篇 会议
11 篇 期刊文献

馆藏范围

261 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

194 篇 工学
- 193 篇 计算机科学与技术...
- 67 篇 软件工程
- 33 篇 电气工程
- 29 篇 电子科学与技术（可...
- 7 篇 控制科学与工程
- 5 篇 建筑学
- 4 篇 动力工程及工程热...
- 4 篇 化学工程与技术
- 3 篇 信息与通信工程
- 3 篇 生物医学工程（可授...
- 2 篇 土木工程
- 2 篇 农业工程
- 2 篇 环境科学与工程（可...
- 2 篇 生物工程
69 篇 管理学
- 57 篇 管理科学与工程(可...
- 12 篇 图书情报与档案管...
- 7 篇 工商管理
43 篇 理学
- 32 篇 数学
- 8 篇 系统科学
- 4 篇 化学
- 4 篇 生物学
- 3 篇 物理学
- 2 篇 地球物理学
- 1 篇 海洋科学
- 1 篇 地质学
- 1 篇 统计学（可授理学、...
3 篇 教育学
- 3 篇 教育学
2 篇 法学
- 2 篇 社会学
2 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 应用经济学

主题

30 篇 graphics process...
24 篇 graphics process...
22 篇 parallel process...
15 篇 runtime
15 篇 computational mo...
15 篇 kernel
13 篇 parallel algorit...
13 篇 instruction sets
12 篇 parallel program...
10 篇 optimization
10 篇 algorithm design...
9 篇 programming
8 篇 computer archite...
8 篇 bandwidth
8 篇 resource allocat...
8 篇 hardware
7 篇 registers
7 篇 synchronization
6 篇 scalability
6 篇 parallel archite...

机构

3 篇 iit dept comp sc...
3 篇 school of comput...
3 篇 oak ridge natl l...
3 篇 intel corp paral...
2 篇 univ tokyo ctr i...
2 篇 ibm tj watson re...
2 篇 tsinghua univ de...
2 篇 lawrence berkele...
2 篇 univ calif berke...
2 篇 univ calif davis...
2 篇 lawrence livermo...
2 篇 mit cambridge ma...
2 篇 pacific northwes...
2 篇 univ calif berke...
2 篇 natl univ singap...
2 篇 stanford univ st...
2 篇 univ calif berke...
2 篇 department of el...
2 篇 univ calif berke...
2 篇 department of co...

作者

4 篇 demmel james
4 篇 yamazaki ichitar...
3 篇 dongarra jack
3 篇 solomonik edgar
3 篇 james demmel
3 篇 buluc aydin
3 篇 yang guangwen
3 篇 sanders peter
2 篇 raicu ioan
2 篇 kim kyungjoo
2 篇 revels jarrett
2 篇 meng jiayuan
2 篇 regier jeffrey
2 篇 mcauliffe jon
2 篇 howard steve
2 篇 kaeli david r.
2 篇 liang jie
2 篇 zomaya albert y.
2 篇 puri satish
2 篇 pamnany kiran

语言

261 篇 英文

检索条件"任意字段=27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013"

共 261 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Proceedings - ieee 27th international parallel and distributed processing symposium, ipdps 2013

Proceedings - IEEE 27th International Parallel and Distribut...

引用

27th ieee international parallel and distributed processing symposium, ipdps 2013

the proceedings contain 108 papers. the topics discussed include: adaptive incremental checkpointing via delta compression for networked multicore systems;towards scalable checkpoint restart: a collective inline memory contents deduplication proposal;on closed nesting and checkpointing in fault-tolerant distributed transactional memory;reliable service allocation in clouds;scaling and scheduling to maximize application performance within budget constraints in cloud workflows;optimizing resource allocation while handling SLA violations in cloud computing platforms;high-throughput analysis of large microscopy image datasets on CPU-GPU cluster platforms;self-adaptive OmpSs tasks in heterogeneous environments;an analytical performance model for partitioning off-chip memory bandwidth;a case for handshake in nanophotonic interconnects;and optimizations and analysis of BSP graph processing models on public clouds.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proceedings - ieee 27th international parallel and distributed processing symposium Workshops and PhD Forum, ipdpsW 2013

Proceedings - IEEE 27th International Parallel and Distribut...

引用

2013 ieee 27th international parallel and distributed processing symposium Workshops and PhD Forum, ipdpsW 2013

the proceedings contain 267 papers. the topics discussed include: network delay-Aware load balancing in selfish and cooperative distributed systems;an analysis framework for investigating the trade-offs between system performance and energy consumption in a heterogeneous computing environment;scheduling tightly-coupled applications on heterogeneous desktop grids;an on-chip heterogeneous implementation of a general sparse linear solver;seeds for a heterogeneous interconnect;architecture exploration of high-performance floating-point fused multiply-Add units and their automatic use in high-level synthesis;a flexible memory controller supporting deep belief networks with fixed-point arithmetic;hardware supported adaptive data collection for networks on chip;automated partitioning for partial reconfiguration design of adaptive systems;and cross-Architectural study of custom reconfigurable devices using crowdsourcing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Malleable Sorting

Malleable Sorting

引用

ieee 27th international parallel and distributed processing symposium (ipdps)

作者： Flick, Patrick Sanders, Peter Speck, Jochen Karlsruhe Inst Technol Dept Informat D-76021 Karlsruhe Germany

ISBN: (纸本)9780769549712

Malleable jobs can adapt to varying degrees of available parallelism. this is an interesting approach to more flexible usage of parallel resources. For example, malleable jobs can be scheduled optimally and efficiently where more restricted forms of parallel jobs are NP-hard to handle. However, little work has been done on how to make fundamental computations malleable. We study how this can be done for sorting. Our algorithm is an adaptive version of Multiway Merge Sort and outperforms a state-of-the art implementation in the multi core STL when the number of available cores fluctuates.

关键词： computational complexity multiprocessing systems parallel processing processor scheduling sorting

来源：评论

学校读者我要写书评

暂无评论

On Closed Nesting and Checkpointing in Fault-Tolerant distributed Transactional Memory

On Closed Nesting and Checkpointing in Fault-Tolerant Distri...

引用

ieee 27th international parallel and distributed processing symposium (ipdps)

作者： Dhoke, Aditya Ravindran, Binoy Zhang, Bo Virginia Tech ECE Dept Blacksburg VA 24061 USA

ISBN: (纸本)9780769549712

We consider the closed nesting and checkpointing model for transactions in fault-tolerant distributed transactional memory (DTM). the closed nested model allows inner-nested transactions to be aborted (in the event of a transactional conflict) without aborting the parent transaction, while checkpointing allows transactions to rollback to a previous execution state, potentially improving concurrency over flat nesting. We consider a quorum-based replicated model for fault-tolerant DTM, and present algorithms to support closed nesting and checkpointing. the algorithms use incremental validation to avoid communication overhead on commit, and ensure 1-copy equivalence. Our experimental studies using a Java DTM implementation of the algorithms on micro and macro benchmarks reveal the conditions when they improve transactional throughput over flat nesting, and also their relative advantages and disadvantages.

关键词： software transactional memory distributed systems replication closed nesting checkpointing

来源：评论

学校读者我要写书评

暂无评论

Programmable and Scalable Reductions on Clusters

Programmable and Scalable Reductions on Clusters

引用

ieee 27th international parallel and distributed processing symposium (ipdps)

作者： Ciesko, Jan Bueno, Javier Puzovic, Nikola Ramirez, Alex Badia, Rosa M. Labarta, Jesus Barcelona Supercomp Ctr Barcelona Spain

ISBN: (纸本)9780769549712

Reductions matter and they are here to stay. Wide adoption of parallel processing hardware in a broad range of computer applications has encouraged recent research efforts on their efficient parallelization. Furthermore, trends towards high productivity languages in mainstream computing increases the demand for efficient programming support. In this paper we present a new approach on parallel reductions for distributed memory systems that provides both scalability and programmability. Using OmpSs, a task-based parallel programming model, the developer has the ability to express scalable reductions through a single pragma annotation. this pragma annotation is applicable for tasks as well as for work-sharing constructs (with implicit tasking) and instructs the compiler to generate the required runtime calls. the supporting runtime handles data and task distribution, parallel execution and data reduction. Scalability is achieved through a software cache that maximizes local and temporal data reuse and allows overlapped computation and communication. Results confirm scalability for up to 32 12-core cluster nodes.

关键词： reductions software cache parallel programming runtime systems distributed systems

来源：评论

学校读者我要写书评

暂无评论

parallel Label-Setting Multi-Objective Shortest Path Search

Parallel Label-Setting Multi-Objective Shortest Path Search

引用

ieee 27th international parallel and distributed processing symposium (ipdps)

作者： Sanders, Peter Mandow, Lawrence Karlsruhe Inst Technol Inst Theoret Informat D-76021 Karlsruhe Germany Univ Malaga E-29071 Malaga Spain

ISBN: (纸本)9780769549712

We present a parallel algorithm for finding all Pareto optimal paths from a specified source in a graph. the algorithm is label-setting, i.e., it only performs work on distance labels that are optimal. the main result is that the added complexity when going from one to multiple objectives is completely parallelizable. the algorithm is based on a multi-objective generalization of a priority queue. Such a Pareto queue can be efficiently implemented for two dimensions. Surprisingly, the parallel biobjective approach yields an algorithm performing asymptotically less work than the previous sequential algorithms. We also discuss generalizations for d >= 3 objective functions and for single target search.

关键词： Pareto analysis computational complexity graph theory parallel algorithms queueing theory

来源：评论

学校读者我要写书评

暂无评论

distributed Low-Latency Out-of-Order Event processing for High Data Rate Sensor Streams

Distributed Low-Latency Out-of-Order Event Processing for Hi...

引用

ieee 27th international parallel and distributed processing symposium (ipdps)

作者： Mutschler, Christopher Philippsen, Michael Univ Erlangen Nurnberg CS Dept Programming Syst Grp Nurnberg Germany

ISBN: (纸本)9780769549712

Event-based Systems (EBS) are used to detect and analyze meaningful events in surveillance, sports, finances and many other areas. With rising data and event rates and with correlations among these events, sequential event processing becomes infeasible and needs to be distributed. Existing approaches cannot deal with the ubiquity of out-of-order event arrival that is introduced by network delays when distributing EBS. Order-less event processing may result in a system failure. We present a low-latency approach based on K-slack that achieves ordered event processing on high data rate sensor and event streams without a-priori knowledge. Slack buffers are dynamically adjusted to fit the disorder in the streams without using local or global clocks. the middleware transparently reorders the event input streams so that events can still be aggregated and processed to a granularity that satisfies the demands of the application. On a Realtime Locating System (RTLS) our system performs accurate low-latency event detection under the predominance of out-of-order event arrival and with a close to linear performance scale-up when the system is distributed over several threads and machines.

关键词： Event-based processing Message-oriented Middleware Scalability and Performance Publish/Subscribe

来源：评论

学校读者我要写书评

暂无评论

Crowdsourcing under Real-Time Constraints

Crowdsourcing under Real-Time Constraints

引用

ieee 27th international parallel and distributed processing symposium (ipdps)

作者： Boutsis, Ioannis Kalogeraki, Vana Athens Univ Econ & Business Dept Informat Athens Greece

ISBN: (纸本)9780769549712

In the recent years we are experiencing the rapid growth of crowdsourcing systems, in which "human workers" are enlisted to perform tasks more effectively than computers, and get compensated for the work they provide. the common belief is that the wisdom of the "human crowd" can greatly complement many computer tasks which are assigned to machines. A significant challenge facing these systems is determining the most efficient allocation of tasks to workers to achieve successful completion of the tasks under real-time constraints. this paper presents REACT, a crowdsourcing system that seeks to address this challenge and proposes algorithms that aim to stimulate user participation and handle dynamic task assignment and execution in the crowdsourcing system. the goal is to determine the most appropriate workers to assign incoming tasks, in such a way so that the real-time demands are met and high quality results are returned. We empirically evaluate our approach and show that REACT meets the requested real-time demands, achieves good accuracy, is efficient, and improves the amount of successful tasks that meet their deadlines up to 61% compared to traditional approaches like AMT.

关键词： distributed systems crowdsourcing real-time

来源：评论

学校读者我要写书评

暂无评论

Early Experience on the Blue Gene/Q Supercomputing System

Early Experience on the Blue Gene/Q Supercomputing System

引用

ieee 27th international parallel and distributed processing symposium (ipdps)

作者： Morozov, Vitali Kumaran, Kalyan Vishwanath, Venkatram Meng, Jiayuan Papka, Michael E. Argonne Natl Lab Argonne IL 60439 USA

ISBN: (纸本)9780769549712

the Argonne Leadership Computing Facility (ALCF) is home to Mira, a 10 PF Blue Gene/Q (BG/Q) system. the BG/Q system is the third generation in Blue Gene architecture from IBM and like its predecessors combines system-on-chip technology with a proprietary interconnect (5-D torus). Each compute node has 16 augmented PowerPC A2 processor cores with support for simultaneous multithreading, 4-wide double precision SIMD, and different data prefetching mechanisms. Mira offers several new opportunities for tuning and scaling scientific applications. this paper discusses our early experience with a subset of micro-benchmarks, MPI benchmarks, and a variety of science and engineering applications running at ALCF. Both performance and power are studied and results on BG/Q is compared with its predecessor BG/P. Several lessons gleaned from tuning applications on the BG/Q architecture for better performance and scalability are shared.

关键词： IBM computers application program interfaces multi-threading parallel machines system-on-chip

来源：评论

学校读者我要写书评

暂无评论

the Bounded Data Reuse Problem in Scientific Workflows

The Bounded Data Reuse Problem in Scientific Workflows

引用

ieee 27th international parallel and distributed processing symposium (ipdps)

作者： Zohrevandi, Mohsen Bazzi, Rida A. Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85287 USA

ISBN: (纸本)9780769549712

Large datasets and time-consuming processes have become the norm in scientific computing applications. the exploration phase in the development of scientific workflows involves trial-and-error with workflow components, which can take a lot of time given the time-consuming nature of the workflow tasks. these facts suggest the possibility of reducing the development time by reusing intermediate data whenever possible. However the storage space is always limited. this introduces a problem: which intermediate datasets from one workflow should be kept to be reused in another workflow, with a limited amount of storage. For the general class of series parallel graphs, we model this problem using a non-linear integer programming formulation and show that it is NP-Hard. We provide a branch and bound optimal algorithm as well as efficient heuristics. We conducted experiments over a large set of randomly-generated workflows as well as a smaller set of synthetic workflows which are based on real-world workflows used by scientists in different disciplines. Our experiments show that the best solution produced by the heuristics only differs from the optimal value by less than 1% on average.

关键词： Scientific Workflows Intermediate Data Data Reuse Series-parallel

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共27页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：