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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,437 篇 会议
109 篇 期刊文献
3 册 图书

馆藏范围

3,549 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,426 篇 工学
- 2,336 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 336 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,503 篇 英文
45 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing"

共 3549 条记录，以下是1341-1350 订阅

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

详细简洁

排序：

Overhead analysis of a dynamic load balancing library for cluster computing

Overhead analysis of a dynamic load balancing library for cl...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Banicescu, Ioana Cariño, Ricolindo L. Pabico, Jaderick P. Balasubramaniam, Mahadevan Department of Computer Science and Engineering Center for Computational Science - ERC Mississippi State University Mississippi State MS 39762 Institute of Computer Science University of the Philippines Los Baños 4031 College Laguna Philippines Department of Computer Science University of New Hampshire Durham NH 03824 IEEE Computer Society ACM SIAM AMS Center for Computational Sciences ERC Mississippi State University Department of Computer Science and Engineering MSU Institute of Computer Science UPLB University of New Hampshire

ISBN: (纸本)0769523129

This paper investigates the overhead of a dynamic load balancing library for large irregular data-parallel scientific applications on general-purpose clusters. The library is based on an integrated approach combining the advantages of novel dynamic loop scheduling strategies as data migration policies with the advances in resource management and task migration capabilities offered by a recently developed parallel runtime system. The paper focuses on the contribution of the runtime system software layer to the total overhead of the library. Experiments to compare the performance of two applications using the library, the N-body simulations and the profiling of a quadrature routine, with the performance of the same applications using an MPI-only implementation of the dynamic scheduling techniques indicate only a slight decrease in performance due to the overhead of the runtime system software layer. The results validate the suitability of the runtime system as an implementation platform for dynamic load balancing schemes, and underscore the significance of using the integrated approach, as well as the benefits of using the library especially in cluster applications characterized by irregular and unpredictable behavior.

关键词： distributed parameter control systems

来源：评论

学校读者我要写书评

暂无评论

Quick reconfiguration in clustered micro-sequencer

Quick reconfiguration in clustered micro-sequencer

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Jafari, Roozbeh Memik, Seda Ogrenci Sarrafzadeh, Majid UCLA 3256N Boelter Hall Los Angeles CA 90095 Northwestern University 2145 Sheridan Road Evanston IL 60208

ISBN: (纸本)0769523129

This paper presents a Micro-Sequencer based reconfigurable system. We introduce the concept of Quick Reconfiguration and compare it with existing "full reconfiguration " schemes. In a typical scenario, reconfiguring a system from one application to another does not require a "full" reconfiguration. Instead we can exploit similarities among various applications to save on reconfiguration time. We show that a significant speedup is gained, by using quick reconfiguration on a set of image processing benchmarks, which takes seconds versus hours in traditional FPGA reconfigurations. We evaluate the flexibility, the performance and the parallelism of this architecture with customized functional units. Furthermore, a method was proposed for customizing clustered datapath to improve the throughput of the system. This method accelerates the system by 13 times on average compared to the case where the same algorithm is running on a modern processor. We also map various applications directly onto FPGAs and measure the silicon area and the power consumption and compare to the case where the applications are implemented on micro-sequencers. On average, micro-sequencer takes 31% more area and consumes 23% more power. However, the reconfiguration time is decreased to less than one second on average while for applications directly mapped onto FPGAs, it is near 3000 seconds.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

CODACS prototype: A platform-processor for CHIARA programs

CODACS prototype: A platform-processor for CHIARA programs

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Verdoscia, Lorenzo CNR Via Castellino 111 80131 Napoli Italy

ISBN: (纸本)0769523129

CODACS (Configurable DAtaflow Computing System) project target is to realize a high performance reconfigurable computing system demonstrator able to directly execute in hardware dataflow graphs generated compiling programs written in CHIARA language [28]. In this paper we present the reconfigurable environment and how it executes chunks of a dataflow graph produced by CHIARA compiler. This environment, which is transparent to the user, consists of a set of processing elements called platformprocessors. Each platform-processor, based on the static dataflow model, is created by a set of identical Computing Units (CUs) and a reconfigurable interconnect. While CUs execute any elementary operator of the language, implement the actor described in the homogeneous High-Level Dataflow System model [30], and act according to the model firing rules, the reconfigurable interconnect allows to execute dataflow graphs directly in hardware. Furthermore, thanks to the homogeneous actor I/O conditions (one output and two input links) of the model, a one-to-one mapping between dataflow actors of the model and CUs occurs in a straightforward manner. Consequently, the platform-processor executes dataflow graphs without: a) using memory to store partial results when data tokens flow from a CU to another;b) generating control tokens during this computation so that graph executions can happen in a completely asynchronous manner. However, synchronizing CUs activities, the platform-processor architecture also allows the execution of pipeline operations.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

MaTCH: Mapping data-parallel tasks on a heterogeneous computing platform using the cross-entropy heuristic

MaTCH: Mapping data-parallel tasks on a heterogeneous comput...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Sanyal, Soumya Das, Sajal K. Dept. of Computer Science and Engineering University of Texas at Arlington Arlington TX 76019-0015

ISBN: (纸本)0769523129

We develop in this paper a new heuristic for mapping a set of heterogeneous interacting tasks of a parallel application onto a heterogeneous computing platform. The problem is well known in literature to be an NP-Hard problem. However, we propose a completely new approach based on the Cross-Entropy (CE) method. This is a new and extremely robust rare event simulation (RES) technique which may be employed to solve difficult combinatorial optimization problems (COPs). We tailor the CE method to the requirements of the problem at hand, develop a mathematical framework, and present our algorithm, MaTCH. This globally iterative randomized procedure is then compared to a previously developed genetic, algorithm (GA). Through some simple experiments we prove the power of MaTCH and we get remarkable improvements in the quality of mapping. The results indicate that, when compared to the GA, MaTCH improves upon the application execution time by over a factor of 38 on a 50 node system graph. We further attest our results by performing an ANOVA test on a sample data set to prove the significance of our results.

关键词： Interactive computer systems

来源：评论

学校读者我要写书评

暂无评论

Efficient scheduling of resources for parallel query processing on grid-based architecture

Efficient scheduling of resources for parallel query process...

引用

6th Asia-Pacific symposium on Information and Telecommunication Technologies

作者： Soe, Khin Mar Nwe, Aye Aye Aung, Than Nwe Naing, Thinn Thu Thein, Ni Lar Univ Comp Studies Yangon Myanmar

ISBN: (纸本)4885522161

parallel query processing is an increasingly attractive option for improving the performance of database systems. It can also be important in Grid since grid technologies have enabled sophisticated interaction and data sharing between resources that may belong to different departments or organizations. The decreasing cost of computing makes parallel query processing economically viable to reduce the response time of decision support queries by using parallel execution to exploit inexpensive resources. In this paper, the architecture of resource scheduling and site selection for parallel queries which are to be executed on the Grid is proposed The main aims are to address the problems of choosing appropriate resources and matching sub plans with these resources. For this reason, decisions have to be made on allocating the available processors among a number of competing database operations running in parallel. For scheduling intra-query parallelism, the new approaches, resource-balancing based site selection algorithm which determines where to execute the upcoming operation sequence based on above architecture, and the resource assignment policy for handling the idle nodes' efficiency well, are proposed. This paper also present the architecture Of scheduling inter-query parallelism and proposed hierarchical model in order to fully exploit the available parallelism and interactions among the different queries.

关键词： grid computing parallel query processing distributed query processing

来源：评论

学校读者我要写书评

暂无评论

PReCinCt: A scheme for cooperative caching in mobile peer-to-peer systems

PReCinCt: A scheme for cooperative caching in mobile peer-to...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Shen, Huaping Joseph, Mary Suchitha Kumar, Mohan Das, Sajal K. Department of Computer Science and Engineering University of Texas at Arlington Arlington TX 76019 United States

ISBN: (纸本)0769523129

Mobile Peer-to-Peer (MP2P) systems consist of mobile peers that collaborate with each other to complete application problems. Information sharing in such environments is a challenging problem due to the fundamental limitations of battery power, wireless bandwidth, and users' frequent mobility. We proposed a novel scheme, called Proximity Regions for Caching in Cooperative MP2P Networks (PReCinCt) to efficiently support scalable data retrieval in large-scale MP2P networks. In the PReCinCt scheme, the network topology is divided into geographical regions where each region is responsible for a set of keys representing the data. In this paper, we extend the PReCinCt scheme to facilitate consistent cooperative caching in MP2P systems. The caching scheme considers data popularity, data size and region-distance during replacement to optimize cache content of peers. PReCinCt employs a hybrid push/pull mechanism to maintain data consistency among replicas in the network. Simulation results show the cost of consistency maintenance in terms of latency and energy consumption is significantly improved in the PReCinCt scheme.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

BondFlow: A system for distributed coordination of workflows over Web services

BondFlow: A system for distributed coordination of workflows...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Balasooriya, Janaka Padhye, Mohini Prasad, Sushil K. Navathe, Shamkant B. Georgia State University Atlanta Georgia Institute of Technology Atlanta Computer Science Department Georgia State University Yamacraw/GEDC Distributed Mobile and Embedded Systems Program College of Computing Georgia Institute of Technology Atlanta United States

ISBN: (纸本)0769523129

Today's collaborative applications over the web span domains as diverse as enterprise e-commerce applications and biomedical applications. We have previously developed and formally investigated "Web Coordination Bonds," a theoretically powerful artifact for interconnecting autonomous web objects for control and data flows, and for enforcing dependencies. Here, we describe BondFlow, a system that enables the configuration and execution of workflows using web bonds over heterogeneous web objects. The system automatically generates lightweight proxy wrapper objects to enable encapsulated web services to be interconnected through web bonds. The small footprint wrappers (less than 10 KB) can reside on Java-enabled handheld devices. We describe the design, architecture and performance of the Bond-Flow system. Our initial performance results indicate that both wrapper creation time and web bond related execution time are small. In contrast to our BondFlow system, existing systems need expert programming to create workflows, do not easily allow distributed coordination of workflows, and usually do not support heterogeneity of device, data and network. The system is preliminary, and further research is ongoing to extend its configuration and execution platforms.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Comprehensive throughput evaluation of LANs in clusters of PCs with switchbench - or how to bring your switch to its knees

Comprehensive throughput evaluation of LANs in clusters of P...

引用

ieee International symposium on Workload Characterization

作者： Rauch, F Natl ICT Australia Sydney NSW Australia

ISBN: (纸本)0780394615

Understanding the performance of parallel applications for prevalent clusters of commodity PCs is still not an easy task: One must understand performance characteristics of all subsystems in the cluster machine, besides the inherently required knowledge about the applications' behaviour. While there are already many benchmarks that characterise a single node's subsystems like CPU, memory and I/O, as well as a few to evaluate its network interface with point-to-point data streams, there are to the best of our knowledge no benchmarks available that characterise a cluster network or LAN as a whole. We present Switchbench [ 14], a set of three microbenchmarks that thoroughly evaluate the throughput characteristics of networks for clusters. A first microbenchmark tests the basic processing limitations of the switches, by sending and receiving data concurrently at maximum throughputs on all network interfaces. A second microbenchmark tests arbitrary communication patterns by pairwise connecting nodes for high-speed throughput tests. A third and slightly more realistic microbenchmark executes an all-to-all personalised communication (AAPC) algorithm to test many different patterns and critical bisections in the network. The microbenchmarks already proved to be extremely useful in a previous study to experimentally quantify performance limitations in different networks of clusters of PCs with up to 128 nodes. We also establish the suitability of our microbenchmarks by comparing their results with two application benchmarks. The benchmarks consist of two C programs supported by shell scripts to start the programs on all nodes of the cluster with the correct execution parameters to automatically scale the workloads from a few nodes up to the full cluster size.

关键词： benchmark testing parallel processing performance evaluation workstation clusters Local Area Network PC clusters Switchbench all-to-all personalised communication test comprehensive throughput evaluation high-speed throughput test microbenchmarks Local Area Networks Benchmark testing workstation clusters Micro computer parallel processing (COMPUTERS) BENCHMARKS Performance Evaluation Switches Network interfaces Ganglia knee CPU memory Throughput Clusters Program Behavior

来源：评论

学校读者我要写书评

暂无评论

Data redistribution and remote method invocation in parallel component architectures

Data redistribution and remote method invocation in parallel...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Bertrand, Felipe Bramley, Randall Bernholdt, David E. Kohl, James A. Sussman, Alan Larson, Jay W. Damevski, Kostadin B. Indiana University Computer Science Department Oak Ridge National Laboratory Computer Science and Mathematics Division University of Maryland UMIACS Department of Computer Science Argonne National Laboratory Mathematics and Computer Science Division University of Utah Scientific Computing and Imaging Institute

ISBN: (纸本)0769523129

With the increasing availability of high-performance massively parallel computer systems, the prevalence of sophisticated scientific simulation has grown rapidly. The complexity of the scientific models being simulated has also evolved, leading to a variety of coupled multi-physics simulation codes. Such cooperating parallel programs require fundamentally new interaction capabilities, to efficiently exchange parallel data structures and collectively invoke methods across programs. So-called "M×N" research, as part of the Common Component Architecture (CCA) effort, addresses these special and challenging needs, to provide generalized interfaces and tools that support flexible parallel data redistribution and parallel remote method invocation. Using this technology, distinct simulation codes with disparate distributed data decompositions can work together to achieve greater scientific discoveries.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Efficient data access for parallel BLAST

Efficient data access for parallel BLAST

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Lin, Heshan Ma, Xiaosong Chandramohan, Praveen Geist, Al Samatova, Nagiza Department of Computer Science North Carolina State University Computer Science and Mathematics Division Oak Ridge National Laboratory

ISBN: (纸本)0769523129

Searching biological sequence databases is one of the most routine tasks in computational biology. This task is significantly hampered by the exponential growth in sequence database sizes. Recent advances in parallelization of biological sequence search applications have enabled bioinformatics researchers to utilize high-performance computing platforms and, as a result, greatly reduce the execution time of their sequence database searches. However, existing parallel sequence search tools have been focusing mostly on parallelizing the sequence alignment engine. While the computation-intensive alignment tasks become cheaper with larger machines, data-intensive initial preparation and result merging tasks become more expensive. Inefficient handling of input and output data can easily create performance bottlenecks even on supercomputers. It also causes a considerable data management overhead. In this paper, we present a set of techniques for efficient and flexible data handling in parallel sequence search applications. We demonstrate our optimizations through improving mpiBLAST, an open-source parallel BLAST tool rapidly gaining popularity. These optimization techniques aim at enabling flexible database partitioning, reducing I/O by caching small auxiliary files and results, enabling parallel I/O on shared files, and performing scalable result processing protocols. As a result, we reduce mpiBLAST users' operational overhead by removing the requirement of prepartitioning databases. Meanwhile, our experiments show that these techniques can bring by an order of magnitude improvement to both the overall performance and scalability of mpiBLAST.

关键词： Data reduction

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 131 132 133 134 135 136 137 138 139 140 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：