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

Workshops on Applications and the Internet (SAINT)

作者： Y. Nakajima M. Sato T. Boku D. Takahashi H. Gotoh Graduate School of Systems & Information Engineering University of Tsukuba Japan Institute of Information Sciences and Electronics University of Tsukuba Japan Knowledge-based Information Engineering Toyohashi University of Technology Japan

OmniRPC is a Grid RPC system for parallel programming in a grid environment. In order to understand the performance characteristics of OmniRPC, we executed a synthetic benchmark program which varies the execution time in remote nodes and the amount of communication on several configurations of our grid environment. The result shows the performance of the application is improved if RPC data transmissions are less than 10 KB, the job time in remote nodes is more than 4 seconds, and RPCs are called more than 256 times. Our result also shows a small performance degradation when using the feature of communication multiplexing. We also measured the performance of the EP application from the NAS parallel benchmark suite. In EP, even if using SSH or the Globus GRAM as methods of agent invocation, both performances are almost the same. As a practical application, we parallelized the CONFLEX molecular confirmation search program using OmniRPC. In the comparison of CONFLEX-G with the CONFLEX MPI version, CONFLEX-G achieves comparable efficiencies to the MPI version and increased speed by using two or more clusters.

关键词： Computer networks Grid computing distributed computing Knowledge engineering parallel programming Pervasive computing Application software systems engineering and theory Data communication Degradation

来源：评论

学校读者我要写书评

暂无评论

Performance of the NAS parallel benchmarks on grid enabled clusters

Performance of the NAS parallel benchmarks on grid enabled c...

引用

IEEE international symposium on Network Computing and Applications

作者： P.J. Sokolowski D. Grosu Department of Electrical and Computer Engineering Wayne State University Detroit MI USA Department of Computer Science Wayne State University Detroit MI USA

As grids become more available and mature in real world settings, users are faced with considerations regarding the efficiency of applications and their capability of utilizing additional nodes distributed over a wide area network. When both tightly coupled clusters and loosely gathered grids are available, a cost effective organization will schedule applications that can execute with minimal performance degradation over wide-area networks on grids, while reserving clusters for applications with high communication costs. We analyze the performance of the NAS parallel benchmarks using both MPICH-G2 and MPICH with the ch/spl ***/p4 device. We compare the results of these communication devices on both tightly and loosely coupled systems, and present an analysis of how parallel applications perform in real-world environments. We make recommendations as to where applications run most efficiently, and under what conditions.

关键词： Switches Performance analysis Grid computing Application software Costs Computer networks Scheduling Delay Bandwidth Testing

来源：评论

学校读者我要写书评

暂无评论

A Mobile Agent Based Middleware for Grid Computing

A Mobile Agent Based Middleware for Grid Computing

引用

2004 international symposium on distributed Computing and Applications to Business, engineering and Science

作者： Peng Dewei,He Yanxiang School of Computer,National Key lab of software engineering, Wuhan University,Wuhan,Hubei 430072,China

Grid provides computational power beyond the capacity of even the largest parallel computer system,and merges extremely heterogeneous physical resources into a single virtual *** spite of its ambitious goals,grid computing still benefits only a handful of researchers who are free to forage among supercomputers and high-performance workstations for their computation-intensive *** majorities of users,on the other hand,have few opportunities to access such computing facilities and are assumed to pay little attention to computational grids in favor of their own desktop computing *** they could authorize each other to mutually use their computers,a collection of such desktop machines would consistently provide them with an enormous computing *** this type of grid systems, besides performance,adaptive and platform independence is the key *** paper describes the architecture of a mobile agent based middleware for grid computing environment, whose aim is acquire adaptive and high performance computing power,and explores the benefits of using mobile agent as its key middleware building *** describe the adaptive mode of task execution of the system,as well as our current work and future plan.

关键词： mobile agent grid computing middleware broker mode

来源：评论

学校读者我要写书评

暂无评论

FORGE: A framework for optimization of distributed embedded systems software

FORGE: A framework for optimization of distributed embedded ...

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Cornea, Radu Dutt, Nikil Gupta, Rajesh Krueger, Ingolf Nicolau, Alex Schmidt, Doug Shukla, Sandeep Department of Computer Science UC Irvine United States Department of Computer Science and Engineering UC San Diego United States Department of Electrical Engineering and Computer Science UC Irvine United States Department of Electrical and Computer Engineering Virginia Tech. United States

ISBN: (纸本)0769519261

FORGE brings together a number of advances in architectural modeling, software architecture and distributed/real-time systems to build a platform that provides two fundamental capabilities for distributed, real time, and embedded (DRE) system development: (a) conceptualization and coding of the design knowledge through collaborative specifications that are inherently matched to distributed solutions;and (b) exploitation of the design knowledge across all development phases for the DRE systems. Our proof-of-concept FORGE prototype is built upon collaborative specifications captured by extensions to the message sequence charts (MSCs) that drive the customization of CompOSEIQ middleware services and generate node-architecture specific code through descriptions of the architecture and resources captured using ADL and RDL respectively. © 2003 IEEE.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Performance analysis integration in the Uintah software development cycle

引用

international JOURNAL OF parallel PROGRAMMING 2003年第1期31卷 35-53页

作者： de St Germain, JD Morris, A Parker, SG Malony, AD Shende, S Univ Utah Sch Comp Salt Lake City UT 84112 USA Univ Oregon Dept Comp & Informat Sci Eugene OR 97403 USA

The increasing complexity of high-performance computing environments and programming methodologies presents challenges for empirical performance evaluation. Evolving parallel and distributed systems require performance technology that can be flexibly configured to observe different events and associated performance data of interest. It must also be possible to integrate performance evaluation techniques with the programming paradigms and software engineering methods. This is particularly important for tracking performance on parallel software projects involving many code teams over many stages of development. This paper describes the integration of the TAU and XPARE tools in the Uintah Computational Framework (UCF). Discussed is the use of performance mapping techniques to associate low-level performance data to higher levels of abstraction in UCF and the use of performance regression testing to provide a historical portfolio of the evolution of application performance. A scalability study shows the benefits of integrating performance technology in building large-scale parallel applications.

关键词： parallel performance software applications

来源：评论

学校读者我要写书评

暂无评论

Stable checkpointing in distributed systems without shared disks

Stable checkpointing in distributed systems without shared d...

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Sobe, Peter University of Lübeck Germany Institute of Computer Engineering Germany

ISBN: (纸本)0769519261

Interacting processes an distributed systems save their checkpoints on local disks for efficiency reasons. But, because local checkpoints get unavailable with failing hosts, redundancy schemes similar to RAID-like storage schemes have to be used. In such systems, checkpoints are stable under a particular fault model because they can get reconstructed in the distributed system. In this paper, two variants of stable checkpoint storage are compared, (a) parity grouping over local checkpoints and (ii) RAID-like distribution of each checkpoint using a software based distributed storage system. An analysis is given to compare costs for collective checkpoint creation, recovery of a single process and rollback of all processes. The results show that despite the differences in detail, checkpointing using a distributed storage system is a reasonable solution. © 2003 IEEE.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

An optimization framework for dynamic, distributed real-time systems

An optimization framework for dynamic, distributed real-time...

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Ecker, Klaus Juedes, David Welch, Lonnie Chelberg, David Bruggeman, Carl Drews, Frank Fleeman, David Parrott, David Pfarr, Barbara Department of Computer Science Technical University of Clausthal Clausthal-Zellerfeld38678 Germany Center for Intelligent Distributed and Dependable Systems School of Electrical Engineering and Computer Science Ohio University AthensOH45701 United States Real-Time Software Engineering Branch NASA Goddard Space Flight Center BaltimoreMD20771 United States

ISBN: (纸本)0769519261

The paper presents a model that is useful for developing resource allocation algorithms for distributed real-time systems that operate in dynamic environments. Interesting aspects of the model include dynamic environments, utility and service levels, which provide a means for graceful degradation in resource-constrained situations and support optimization of the allocation of resources. The paper also provides an allocation algorithm that illustrates how to use the model for producing feasible, optimal resource allocations. © 2003 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Quantifying locality effect in data access delay: Memory logP

Quantifying locality effect in data access delay: Memory log...

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Cameron, Kirk W. Sun, Xian-He Dept. of Computer Science and Engineering University of South Carolina ColumbiaSC29208 United States Department of Computer Science Illinois Institute of Technology ChicagoIL60616 United States

ISBN: (纸本)0769519261

The application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter-node communication in a shared memory cluster. However, inclusion in the model of message characteristics and complex memory hierarchies may result in impractical models. Nonetheless, the growing gap between memory and CPU performance combined with the trend toward large scale clustered shared memory platforms implies an increased need to consider the impact of local memory communication on parallel processing in distributed systems. We present a simple and useful model of point-to-point memory communication to predict and analyze the latency of memory copy, pack and unpack. We use the model to isolate contributions of hardware, middleware, and software to data transfers on Intel- and MIPS-based platforms. © 2003 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

GridBank: A Grid Accounting Services Architecture (GASA) for distributed systems sharing and integration

GridBank: A Grid Accounting Services Architecture (GASA) for...

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Barmouta, Alexander Buyya, Rajkumar Dept. of Computer Science and Software Engineering University of Western Australia NedlandsWA6009 Australia Lab Dept. of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)0769519261

Computational Grids are emerging as a new infrastructure for Internet-based parallel and distributed computing. They enable the sharing, exchange, discovery, and aggregation of resources distributed across multiple administrative domains, organizations and enterprises. To accomplish this, Grids need infrastructure that supports various services: security, uniform access, resource management, scheduling, application composition, computational economy, and accounting. Although several initiatives are engaged in the development of Grid technologies, Grid accounting issues are yet to be addressed. To overcome this limitation, we propose a new infrastructure called GridBank that provides services for accounting. The support of computational economy and accounting services can lead to a self-regulated accountability in Grid computing. This paper presents requirements of Grid accounting and different economic models within which it can operate and proposes a Grid Accounting Services Architecture to meet them. The paper highlights implementation issues with a detailed discussion on the format for various records/databases that the GridBank needs to maintain. It also presents protocols for interaction between the GridBank and various components within Grid computing environments. © 2003 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Using Golomb rulers for optimal recovery schemes in fault tolerant distributed computing

Using Golomb rulers for optimal recovery schemes in fault to...

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Klonowska, Kamilla Lundberg, Lars Lennerstad, Håkan Department of Software Engineering and Computer Science Blekinge Institute of Technology RonnebyS-372 25 Sweden

ISBN: (纸本)0769519261

Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all computers are up and running, we would like the load to be evenly distributed among the computers. When one or more computers break down the load on these computers must be redistributed to other computers in the cluster. The redistribution is determined by the recovery scheme. The recovery scheme should keep the load as evenly distributed as possible even when the most unfavorable combinations of computers break down, i.e. we want to optimize the worst-case behavior. In this paper we define recovery schemes, which are optimal for a number of important cases. We also show that the problem of finding optimal recovery schemes corresponds to the mathematical problem called Golomb rulers. These provide optimal recovery schemes for up to 373 computers in the cluster. © 2003 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：