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

3rd International Symposium on parallel and distributed Processing and Applications, ISPA 2005

作者： Yang, Chao-Tung Shih, Po-Chi Lin, Cheng-Fang Hsu, Ching-Hsien Li, Kuan-Ching High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 40704 Taiwan Department of Computer Science and Information Engineering Chung Hua University Hsinchu 300 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung 43301 Taiwan

ISBN: (纸本)3540297693

In order to identify and schedule jobs that are suitable for determined resources, an execution time estimation model is required. In this paper, it is described a Chronological history-based execution time estimation model to predict current execution time, according to the previous execution results. We built a heterogeneous computational Grid environment using Globus Toolkit, and our research is focused in Grid computing environments and to execute parallel jobs on multiple resources by measuring its accuracy. The experimental results shown that our model can accurately predict the execution time of embarrassingly parallel applications. © Springer-Verlag Berlin Heidelberg 2005.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Visuel: A novel performance monitoring and analysis toolkit for cluster and grid environments

引用

6th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP

作者： Li, Kuan-Ching Cheng, Hsiang-Yao Yang, Chao-Tung Hsu, Ching-Hsien Wang, Hsiao-Hsi Hsu, Chia-Wen Hung, Sheng-Shiang Chang, Chia-Fu Liu, Chun-Chieh Pan, Yu-Hwa Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung 43301 Taiwan High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 40704 Taiwan Department of Computer Science and Information Engineering Chung Hua University Hsinchu 300 Taiwan

ISBN: (纸本)3540292357

The computing power provided by high performance low-cost PC-based Cluster and Grid platforms are attractive, and they are equal or superior to supercomputers and mainframes widely available. In this research paper, we present the design rationale and implementation of Visuel, a toolkit for performance measurement and analysis of MPI parallel programs and real time resources monitoring in cluster and grid computing environments. The proposed toolkit is web-based interface to show performance activities of all computing nodes involved in the execution of a MPI parallel program, such as CPU and memory usage levels of each computing node, and monitors all computing nodes of a computing platform by displaying real time performance data. In addition, this toolkit is able to display comparative performance data charts of multiple executions of MPI parallel application under investigation, which facilitates the "what-if" analysis. The usage of this toolkit shows that it outperforms in easing the process of investigation of parallel applications. © Springer-Verlag Berlin Heidelberg 2005.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Embedding of cycles in rotator and incomplete rotator graphs

Embedding of cycles in rotator and incomplete rotator graphs

引用

International Symposium on parallel and distributed Processing (IPDPS)

作者： S. Ponnuswamy V. Chaudhary Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

Symmetric directed Cayley graphs called rotator graphs have been proposed recently in the literature. In addition to a lower diameter and average distance compared to the star graph, hypercube, and k-ary n-cubes, these rotator graphs also have a rich cyclic structure. We identify a variety of disjoint cycles in rotator graphs. An efficient algorithm for Hamiltonian cycles in rotator graphs is presented. This algorithm uses a basic sequence of four generators repeatedly with generators of higher order in between, to obtain Hamiltonian cycle in any n-rotator graph. We study the embedding of undirected cycles and directed cycles in rotator graphs. We also prove that the incomplete rotator graph obtained from the rotator graph is Hamiltonian. The embedding of undirected rings in rotator graphs is shown to have a low average dilation.< >

关键词： Multiprocessor interconnection networks distributed computing parallel processing Algorithm design and analysis Laboratories Concurrent computing Hypercubes Optical fiber communication Very large scale integration Protocols

来源：评论

学校读者我要写书评

暂无评论

Mapping algorithms for permutation networks

Mapping algorithms for permutation networks

引用

Midwest Symposium on Circuits and Systems (MWSCAS)

作者： V. Chaudhary Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

The mapping problem arises when the dependency structure of a parallel algorithm differs from the interconnection of processors in the intended parallel computer (topological variation) or, when the number of processes required by the algorithm exceeds the number of processors available in the computer (cardinality variation). The problem discussed in this paper is to identify a distributed computing environment that best optimizes the objective function for the given problem. Distinct network permutations may result in equivalent process permutation depending upon the mapping of processes onto the processors. In this paper we study the permuting properties of dynamic interconnection networks taking process mapping into consideration. A uniform group theoretic representation for interconnection networks is developed. Finally, an algorithm to evaluate the number of passes required by an interconnection network to realize a given mapping is presented.< >

关键词： Multiprocessor interconnection networks distributed computing Concurrent computing parallel algorithms Multiprocessing systems Laboratories Costs Delay effects Routing

来源：评论

学校读者我要写书评

暂无评论

Strings: a high-performance distributed shared memory for symmetrical multiprocessor clusters 98

Strings: a high-performance distributed shared memory for sy...

引用

International Symposium on High Performance distributed computing

作者： S. Roy V. Chaudhary Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

ISBN: (纸本)9780818685798

Introduces Strings, a high-performance distributed shared memory system designed for clusters of symmetrical multiprocessors (SMPs). The distinguishing feature of this system is the use of a fully multithreaded runtime system, written using POSIX threads. Strings also allows multiple application threads to be run on each node in a cluster. Since most modern UNIX systems can multiplex these threads on kernel-level lightweight processes, applications written using Strings can use all the processors in a SMP machine. This paper describes some of the architectural details of the system and analyzes the performance improvements with two example programs and a few benchmark programs from the SPLASH-2 suite.

关键词： Programming profession Yarn Microprocessors Workstations Sun Concurrent computing Laboratories Fuels Oceans Drugs

来源：评论

学校读者我要写书评

暂无评论

Contention sensitive fault-tolerant routing algorithms for hypercubes

Contention sensitive fault-tolerant routing algorithms for h...

引用

International Symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： R. Srinivasan V. Chaudhary S.M. Mahmud Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

We present two new fault tolerant routing algorithms for hypercubes. The first algorithm requires only local knowledge of the faults whereas the second algorithm requires global knowledge. Unlike previous fault tolerant routing algorithms, our algorithms take into consideration the dynamic conditions (link contention) of the network. We have shown that checking for dynamic conditions in fault tolerant algorithms is essential. Performance evaluation by extensive simulation of our algorithms and other fault tolerant routing algorithms show that ours are better than previous algorithms by as much as 50%; and 500%; in time and space, respectively. We also observed that global information about the location of faults does not give us additional benefit. This observation is true regardless of the consideration of the dynamic conditions in the network.< >

关键词： Fault tolerance Routing Hypercubes Telecommunication traffic distributed computing Laboratories Network topology Scalability Hardware Adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

Data management for large‐scale scientific computations in high performance distributed systems

引用

Cluster computing 2000年第1期3卷 45-60页

作者： Choudhary, A. Kandemir, M. No, J. Memik, G. Shen, X. Liao, W. Nagesh, H. More, S. Taylor, V. Thakur, R. Stevens, R. Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston USA Department of Computer Science and Engineering The Pennsylvania State University University Park USA Mathematics and Computer Science Division Argonne National Laboratory Argonne USA

With the increasing number of scientific applications manipulating huge amounts of data, effective high-level data management is an increasingly important problem. Unfortunately, so far the solutions to the high‐level data management problem either require deep understanding of specific storage architectures and file layouts (as in high-performance file storage systems) or produce unsatisfactory I/O performance in exchange for ease-of-use and portability (as in relational DBMSs). In this paper we present a novel application development environment which is built around an active meta-data management system (MDMS) to handle high-level data in an effective manner. The key components of our three-tiered architecture are user application, the MDMS, and a hierarchical storage system (HSS). Our environment overcomes the performance problems of pure database-oriented solutions, while maintaining their advantages in terms of ease-of-use and portability. The high levels of performance are achieved by the MDMS, with the aid of user-specified, performance-oriented directives. Our environment supports a simple, easy-to-use yet powerful user interface, leaving the task of choosing appropriate I/O techniques for the application at hand to the MDMS. We discuss the importance of an active MDMS and show how the three components of our environment, namely the application, the MDMS, and the HSS, fit together. We also report performance numbers from our ongoing implementation and illustrate that significant improvements are made possible without undue programming effort.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Quality of Service Based Scheduling Algorithm for Wide Area Large Scale Problems

An Adaptive Quality of Service Based Scheduling Algorithm fo...

引用

IEEE International Symposium on Network computing and Applications

作者： W. Lozano W. Rivera Parallel and Distributed Computing Laboratory Electrical and Computer Engineering Department University of Puerto Rico MayagÜez Puerto Rico

This paper explores the problem of dynamically scheduling large scale applications over wide area networks and then proposes an adaptive scheduling algorithm to provide quality of service. Our adaptive algorithm takes into account unexpected events and priority fluctuations and gives high priority to jobs with low probability of failure. Experimental results show that the new approach outperforms traditional scheduling approaches in grid computing environments

关键词： Quality of service Scheduling algorithm Large-scale systems Dynamic scheduling Wide area networks Adaptive scheduling Adaptive algorithm Fluctuations Processor scheduling Grid computing

来源：评论

学校读者我要写书评

暂无评论

Using Grid computing to Enable distributed Radar Data Retrieval and Processing

Using Grid Computing to Enable Distributed Radar Data Retrie...

引用

IEEE International Conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Diego Arias Wilson Rivera Parallel and Distributed Computing Laboratory Electrical and Computer Engineering Department University of Puerto Rico MayagÜez Puerto Rico

We describe a tool that implements a set of services to manipulate and store data from a radar network in a transparent way to end users. A major requirement of this system is data availability and reliability. Consequently, we have implemented a redundancy schema based on the information dispersal algorithm (IDA). Preliminary results show that the IDA based replication provides better reliability and less storage spending than traditional replication

关键词： Grid computing Radar Information retrieval Atmosphere Earth distributed computing computer networks Concurrent computing Reliability engineering Availability

来源：评论

学校读者我要写书评

暂无评论

A V2X-based approach for reduction of delay propagation in vehicular Ad-Hoc networks

A V2X-based approach for reduction of delay propagation in v...

引用

2011 11th International Conference on ITS Telecommunications, ITST 2011

作者： Mostafa, Ahmad Vegni, Anna Maria Singoria, Rekha Oliveira, Talmai Little, Thomas D.C. Agrawal, Dharma P. School of Computing Sciences and Informatics Center for Distributed and Mobile Computing University of Cincinnati Cincinnati OH United States Department of Applied Electronics University of Roma Tre Rome Italy Department of Electrical and Computer Engineering Boston University Boston MA United States

ISBN: (纸本)9781612846712

In this paper we investigate the time delay propagation rates in a Vehicular Ad-Hoc Network, where vehicular connectivity is supported by both Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) protocols. In our vision, seamless connectivity issues in a VANET with nearby network infrastructure, can be fixed by an opportunistic choice of a vehicular protocol between V2V and V2I. Such a decision is taken by each vehicle whenever it needs to transmit messages. Our technique called as Vehicle-to-X represents a handoff procedure between V2V and V2I, and vice versa, in order to keep vehicles connected independent of mobility issues and traffic scenarios. We investigate the time delay as a performance metric for protocol switching, and present the time propagation rates which occur when vehicles are transmitting warning messages, via V2V or V2I. Simulation results show how the simultaneous usage of pre-existing network infrastructure, together with inter-vehicular communications, provides low delays;while traditional opportunistic vehicular communications increases the transmission time delays and does not guarantee seamless connectivity to vehicles. © 2011 IEEE.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：