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

Special Section: DAPSYS, workshop on distributed and parallel systems

FUTURE GENERATION COMPUTER SYSTEMS-THE international JOURNAL OF GRID computing AND ESCIENCE 2010年第3期26卷 471-472页

作者： Nemeth, Zsolt Fahringer, Thomas Kacsuk, Peter MTA SZTAKI Comp & Automat Res Inst H-1518 Budapest Hungary Univ Innsbruck Inst Comp Sci A-6020 Innsbruck Austria

The July 2009 special issue of Future Generation Computer Systems presents selected articles of DAPSYS, Austrian-Hungarian Workshop on distributed and parallel Systems, an international biannual conference series dedicated to all aspects of distributed and parallel computing. The article by Augusto Ciuffoletti proposes a soft mutual exclusion algorithm for distributed computing. Thara Angskun and co-researchers investigate self-healing capabilities of scalable fault tolerant distributed environments. Louis Gesbert and co-workers introduce a parallel extension of the ML functional language, the Bulk Synchronous ML (BSML). Boguslaw Butrylo presents a classic parallel programming challenge, a comparative analysis of a matrix solver, a cluster based with message passing and a dynamically reconfigurable shared memory cluster based with communication on the fly. József Kovács and colleagues focus on parallel checkpointing issues.

关键词： parallel programming distributed programming distributed systems parallel algorithms distributed applications

来源：评论

学校读者我要写书评

暂无评论

Fast Circuit Simulation Based on parallel-distributed LIM using Cloud computing System

引用

JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE 2010年第1期10卷 49-54页

作者： Inoue, Yuta Sekine, Tadatoshi Hasegawa, Takahiro Asai, Hideki Shizuoka Univ Dept Informat Sci & Technol Hamamatsu Shizuoka Japan

This paper describes a fast circuit simulation technique using the latency insertion method (LIM) with a parallel and distributed leapfrog algorithm. The numerical simulation results on the PC cluster system that uses... 详细信息

关键词： Latency insertion method fast circuit simulation parallel computing cloud computing system

来源：评论

学校读者我要写书评

暂无评论

Searching and updating metric space databases using the parallel EGNAT

Searching and updating metric space databases using the para...

引用

IASTED international conference on parallel and distributed computing and networks, pdcn 2007

作者： Marin, Mauricio Uribe, Roberto Barrientos, Ricardo

ISBN: (纸本)9780889866379

The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It allows searching for similar objects represented in metric spaces. The sequential EGNAT has been shown to achieve good performance in high-dimentional metric spaces with properties (not found in others of the same kind) of allowing update operations and efficient use of secondary memory. Thus, for example, it is suitable for indexing large multimedia databases. However, comparing two objects during a search can be a very expensive operation in terms of running time. This paper shows that parallel computing upon clusters of PCs can be a practical solution for reducing running time costs. We describe alternative distributions for the EGNAT index and their respective parallel search/update algorithms and concurrency control mechanism.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Multilevel task-partition algorithm for parallel simulation of power system dynamics

Multilevel task-partition algorithm for parallel simulation ...

引用

IASTED international conference on parallel and distributed computing and networks, pdcn 2007

作者： Qi, Shanxiang Xue, Wei Zheng, Weimin Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9780889866379

Nowadays, the partition problem in the parallel computing is becoming more and more important [1]. Particular in power system dynamic simulation, it is critical to design an efficient partition method to reduce the communication and balance the computation of each process. This paper presents a novel multilevel partition scheme for parallel computing based on the bisection graph partition algorithm. By introducing the weight of the nodes and lines which can represent the amount of communication and computation of each unit effectively, the evaluation function and other means, we can efficiently improve the defects in the traditional partition method and the simple district method. Simulations of the new method were performed for two large scale power systems. With eight and twelve CPUs, the efficiency of our algorithm was about 70% and 63% higher than that of METIS, a famous program used for partitioning graphs and hypergraphs and computing fill-reducing orderings of sparse matrices. Thus, the algorithm satisfies the dynamic simulation requirement for large scale complex power grids.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

parallel and concurrent search for fast AND/OR tree search on multicore processors

Parallel and concurrent search for fast AND/OR tree search o...

引用

IASTED international conference on parallel and distributed computing and networks, pdcn 2009

作者： Takano, Fumiyo Maekawa, Yoshitaka Kasahara, Hironori Department of Computer Science and Engineering Waseda University 3-4-1 Ohkubo Shinjuku Tokyo Japan Japan Society for the Promotion of Science Japan Department of Computer Science Chiba Institute of Technology 2-17-1 Tsudanuma Narashino Chiba Japan

ISBN: (纸本)9780889867840

This paper proposes a fast AND/OR tree search algorithm using a multiple paths parallel and concurrent search scheme for embedded multicore processors. Currently, not only PCs or supercomputers but also information appliances such as game consoles, mobile devices and car navigation systems are equipped with multicore processors for better cost performance and lower power consumption. However, the number of processor cores and the amount of memories in embedded multicore processors are limited for lowering power consumption and chip costs. Development of parallel application programs on embedded multicore processors requires exploitation of parallelism and effective utilization of small memories. The proposed algorithm allows us to search in parallel many paths including lowly evaluated nodes and paths including highly evaluated nodes. The algorithm also uses depth-first search, working on small memories. The proposed algorithm is applied for a tsume-shogi (Japanese chess problem) solver as a typical AND/OR tree search problem on an embedded multicore processor system, NEC Electronics NaviEngine with four ARM processor cores. Evaluation results for 100 problems show that the proposed algorithm executed on two processor cores is 2.36 times faster, and executed on four processor cores is 4.17 times faster than the sequential algorithm on the average.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

One-to-all personalized communication in torus networks

One-to-all personalized communication in torus networks

引用

IASTED international conference on parallel and distributed computing and networks, pdcn 2007

作者： Mao, Weizhen Chen, Jie Watson III, William Department of Computer Science College of William and Mary Williamsburg VA 23187 United States High Performance Computing Group Jefferson Lab. Newport News VA 23606 United States

ISBN: (纸本)9780889866379

Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each of the other processors in the network. Under the assumptions of same-size data to each processor, storeand-forward routing, and all-port processors, we formulate the one-to-all personalized communication problem as an optimization problem with the goal to minimize the total elapsed time (measured in the number of time steps) for all data to reach their respective destinations. We design an optimal algorithm based on partitioning the torus network into disjoint subnetworks. We also present a heuristic algorithm based on a greedy strategy. We implement the algorithms on two Linux clusters with Gigabit Ethernet torus connection, currently in use at the Jefferson National Lab and configured as a 2-dimensional 8 x 8 torus and a 3-dimensional 4 x 8 x 8 torus, respectively. We analyze the performance of the algorithms using data collected in experiments.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

distributed data gathering and data multicasting for wireless sensor networks with multiple mobile sinks

Distributed data gathering and data multicasting for wireles...

引用

IASTED international conference on parallel and distributed computing and networks, pdcn 2009

作者： Park, Soochang Lee, Euisin Yu, Fucai Jin, Min-Sook Kim, Sang-Ha Department of Computer Engineering Chungnam National University 220 Gung-dong Yuseong-gu Daejeon 305 764 Korea Republic of

ISBN: (纸本)9780889867840

In wireless sensor networks, groups of mobile users interested in equivalent information could be classified into two categories according to existence of direct communication channel among the users: 1) loosely coupled user group and 2) tightly coupled user group. The loosely coupled group means that a mobile user should communicate with others via a wireless sensor network for querying, gathering, and sharing of information interested from the group. Information communication mechanisms to support mobility of the loosely coupled user groups have already been proposed. However, the mechanisms may not suit in case of sensor applications with multiple data sources since those are usually construct a network structure per each source. Namely, according to the mechanisms, too many network structures for the many data sources could be constructed and it may causes excessive computing overhead and energy exhaustion of sensors. Therefore, we propose an information communication mechanism to support mobility of loosely coupled mobile users in sensor applications with multiple sources. First, we examine the problems for mobility support of the loosely coupled groups in wireless sensor networks with multiple source nodes, and then study the dynamic sink communication model for data gathering from multiple sources and data delivery to a mobile user. Finally, we present an energy-efficient solution to support mobility of loosely coupled groups based on data gathering tree establishment via distributed manner and tree-based data multicasting.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

Autovectorization-friendly program transformation in the array processing language

Autovectorization-friendly program transformation in the arr...

引用

IASTED international conference on parallel and distributed computing and networks, pdcn 2009

作者： Shirota, Yusuke Segawa, Jun'ichi Matsui, Yukio Kanai, Tatsunori Corporate Research and Development Center TOSHIBA Corporation 1 Komukai-Toshiba-cho Saiwai-ku Kawasaki 212-8582 Japan

ISBN: (纸本)9780889867840

Productivity of parallel programs for evolving multicore architecture is increasingly becoming an important issue. To address this issue, we designed an architecture-independent programming system, with our new high-level language dedicated to array processing. Array processing programs are translated into parallelized C++ programs customized for each processor architecture by our translator. To enhance performance of the generated C++ programs by exploiting SIMD instructions effectively with minimal effort of supporting new architectures, it is preferable to use auto-vectorization features of C++ compilers. However, auto-vectorization is often restricted to inner-most loops in which all memory access are consecutive. Furthermore, it is at most important to optimize memory access;otherwise, the effect of vectorization is hidden in memory access latency. For optimization, our language is designed to allow the translator to easily extract adjacency properties of arrays from the array-oriented operators. To enhance compilation with auto-vectorization, we propose a high-level program transformation method using the extracted information. We confirmed that C++ programs with inner-most loops amendable to auto-vectorization can be generated.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

parallel Simulation of Large-scale Microscopic Traffic networks

Parallel Simulation of Large-scale Microscopic Traffic Netwo...

引用

2nd IEEE international conference on Advanced Computer Control

作者： Dai, Wei Zhang, Jiachen Zhang, Dongliang Jilin Univ Dept Comp Sci & Technol Changchun 130023 Peoples R China Tongji Univ Dept Comp Sci & Technol Shanghai Peoples R China

ISBN: (纸本)9781424458479

Microscopic traffic simulation is an effective way to analyze the feature and behavior of transportation systems. However performing microscopic simulations for large-scale networks remains a huge computing problem. Intensive computation characteristics displayed in traffic simulation can benefit from parallel, distributed processing. Based on simplified models, a MPI based distributed parallel traffic simulation system is implemented. And by applying monolateral communication strategy, a high performance is acquired.

关键词： parallel simulation traffic network MPI monolateral communication

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation with Supply Adjustment in distributed computing Systems

Resource Allocation with Supply Adjustment in Distributed Co...

引用

international conference on distributed computing Systems (ICDCS 2010)

作者： Danak, Amir Mannor, Shie McGill Univ Dept Elect & Comp Eng Montreal PQ Canada

ISBN: (纸本)9780769540597

We present two resource-allocation mechanisms for on-demand computing services in parallel and distributed systems, where users pay for their actual usage of the computational resources. We specialize our solution for allocation of grid resources which is a challenging issue due to the dynamic behavior of the system. The problem is studied from the seller's point of view and adjustment of the market capacity is proposed as his strategic move to maximize his profit from resource sharing.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：