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

Proceedings of the 14th international conference on Supercomputing

作者： X. Shen W. Liao A. Choudhary G. Memik M. Kandemir S. More G. Thiruvathukal A. Singh Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL Department of Computer Science and Engineering The Pennsylvania State University University Park PA School of Computing Telecommunications and Information Sciences JHPC Laboratory Depaul University

Our results demonstrate that our novel application development environment provides both ease-of-use and high performance for large-scale, I/O-intensive scientific applications.

ISBN: (纸本)9781581132700

Our results demonstrate that our novel application development environment provides both ease-of-use and high performance for large-scale, I/O-intensive scientific applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Buffer management in wormhole-routed torus multicomputer networks 7th

Buffer management in wormhole-routed torus multicomputer net...

引用

7th International Conference on High-Performance computing and Networking, HPCN Europe 1999

作者： Kotapati, Kamala Dandamudi, Sivarama P. Newbridge Networks Kanata Canada Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

ISBN: (纸本)3540658211

This paper focuses on buffer management issues in wormhole-routed torus multicomputer networks. The commonly used buffer organizations are the centralized and dedicated buffer organizations. The results presented in this paper indicate that the dedicated buffer organization provides better performance than the centralized organization under uniform traffic. Under high hot-spot traffic, the centralized organization outperforms the dedicated. The hybrid buffer organization proposed in this paper inherits the merits of the centralized and distributed organizations. The results presented suggest that the hybrid buffer organization can be designed to configure dynamically from the dedicated to centralized depending on the traffic conditions. © Springer-Verlag Berlin Heidelberg 1999.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Centralized architecture for parallel query processing on networks of workstations 7th

Centralized architecture for parallel query processing on ne...

引用

7th International Conference on High-Performance computing and Networking, HPCN Europe 1999

作者： Zeng, Sijun Dandamudi, Sivarama P. CrossKeys System Corporation Kanata Canada Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

ISBN: (纸本)3540658211

Network of workstations (NOW) is a cost-effective alternative to a multiprocessor system. Here we propose a centralized architecture for parallel query processing on network of workstations. We describe a three-level processing strategy and evaluate its performance. The top two levels use a space-sharing technique to assign a partition to a query. The third-level uses a chunk-based load sharing policy to accommodate dynamic local load present on the workstations. To evaluate the performance of this three-level strategy, we have implemented it using PVM on a Pentium-based NOW. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Accurate performance prediction using visual prototypes

引用

Concurrency and Computation: Practice and Experience 1999年第11期11卷

作者： G. R. Ribeiro Justo T. Delaitre M. J. Zemerly S. C. Winter Centre for Parallel Computing Cavendish School of Computer Science University of Westminster 115 New Cavendish Street London W1M 8JS UK

Behavioural and performance analysis is a fundamental problem in the development of parallel (and distributed) programs. To address this problem, models and supporting environments are required to enable designers to build and analyse their programs. The model we put forward in this paper combines graphical and textual representations of the program structure and uses discrete-event simulation for performance and behaviour predictions. A graphical environment supports our model, providing, amongst other features, a graphical editor, a simulation engine and a performance and behaviour visualisation tool. A number of case studies using this environment are also provided for illustration and validation of our model. Prediction errors observed in comparisons of real execution and simulation of case studies have accuracy to within 10%. Copyright © 1999 John Wiley & Sons, Ltd.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of Adaptive and Hierarchical Load Sharing Policies for distributed Systems 13

A Comparative Study of Adaptive and Hierarchical Load Sharin...

引用

13th International Conference on computers and Their Applications, CATA 1998

作者： Dandamudi, Sivarama P. Lo, Michael Kwok Cheong Centre for Parallel and Distributed Computing School of Computer Science Carleton University OttawaONK1S 5B6 Canada Nortel Technologies OttawaON Canada

ISBN: (纸本)9781618395443

Dynamic load sharing policies take system state into account in making load distribution decisions. The state information can be maintained in one of two basic ways: distributed or centralized. Two principal types of policies that belong to the distributed scheme are the sender-initiated and receiver-initiated policies. In the centralized scheme, a central coordinator node is responsible for collecting system state information. distributed policies do not perform as well as the centralized policy. Performance of distributed policies is sensitive to variance in job service times and inter-arrival times. distributed policies, however, are scalable whereas the centralized policy can cause bottleneck and fault-tolerance problems for large systems. An adaptive distributed policy has been proposed that dynamically switches between sender-initiated and receiver-initiated policies depending on the system state. Here we propose a new global hierarchical load sharing policy that minimizes the drawbacks associated with the distributed and centralized policies while retaining their advantages. We provide a performance comparison of these policies and show that the proposed hierarchical policy provides the best performance among the distributed and adaptive policies for all the various system and workload parameters considered. © 13th International Conference on computers and Their Applications 1998, CATA 1998. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance of hard real-time transaction scheduling policies in parallel database systems

Performance of hard real-time transaction scheduling policie...

引用

International Symposium on Modeling, Analysis and Simulation of computer and Telecommunication Systems (MASCOTS)

作者： S. Takkar S.P. Dandamudi Centre for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa ONT Canada

Real-time transactions, in addition to preserving consistency of the database as in traditional transactions, have to meet the deadlines. Scheduling real-time transactions in parallel database systems has not received much attention. This paper focuses on real-time transaction scheduling in shared-nothing parallel database systems. We evaluate the performance of a new priority-based scheduling policy, in which all scheduling decisions are made locally by each node. In contrast, several other algorithms, proposed for the distributed systems, require communication among the nodes to globally synchronize their local block and abort decisions. Such synchronization can deteriorate performance as real-time transactions will have to meet deadlines. We use miss ratio as the performance metric and show that, in general, the new policy provides a superior performance for the workload and system parameters considered in this study.

关键词： Real time systems Database systems Transaction databases Processor scheduling System recovery Timing distributed computing computer science distributed databases Measurement

来源：评论

学校读者我要写书评

暂无评论

Hierarchical architecture for parallel query processing on networks of workstations

Hierarchical architecture for parallel query processing on n...

引用

International Conference on High Performance computing

作者： Boquan Xie S.P. Dandamudi Centre for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa ONT Canada Nortel Technologies Inc. Ottawa Canada

Networks of workstations (NOWs) are cost-effective alternatives to multiprocessor systems. Recently, NOWs have been proposed for parallel query processing. Idle CPU cycles of workstations in a NOW-based system can be used to process database query operations. We report on the performance of the hierarchical architecture for parallel query processing on a NOW. We have implemented the hierarchical architecture using PVM on a Pentium-based NOW. The experimental results reported suggest that the hierarchical architecture is successful in achieving good scale-ups and speedups indicating that the idle processor cycles are effectively used for query processing. The hierarchical system can also handle both light and heavy workloads in a load sharing fashion. Our results also suggest that the performance is sensitive to the minimum fragmentation size (chunk size) for partial operations and the structure of queries.

关键词： Query processing Workstations Database systems computer architecture Delay Performance gain distributed computing computer science Transaction databases Personal communication networks

来源：评论

学校读者我要写书评

暂无评论

A hierarchical processor scheduling policy for distributed-memory multicomputer systems

A hierarchical processor scheduling policy for distributed-m...

引用

International Conference on High Performance computing

作者： S.P. Dandamudi T.K. Thyagaraj Centre for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa ONT Canada

Processor scheduling policies for distributed memory systems can be divided into space sharing or time sharing policies. In space sharing, the set of processors in the system is partitioned and each partition is assigned for the exclusive use of a job. In time sharing policies, on the other hand, none of the processors is given exclusively to jobs; instead, several jobs share the processors (for example, in a round robin fashion). There are advantages and disadvantages associated with each type of policy. Typically, space sharing policies are good at low to moderate system loads and when job parallelism does not vary much. However, at high system loads and widely varying job parallelism, time sharing policies provide a better performance. We propose a new policy that is based on a hierarchical organization that incorporates the merits of these two types of policies. The new policy is a hybrid policy that uses both space sharing as well as time sharing to achieve better performance. We demonstrate that, at most system loads of interest, the proposed policy outperforms both space sharing and time sharing policies by a wide margin.

关键词： Processor scheduling Time sharing computer systems Round robin parallel processing distributed computing computer science Large-scale systems Concurrent computing Message passing Delay

来源：评论

学校读者我要写书评

暂无评论

ON RELIABILITY ANALYSIS OF CHORDAL RINGS

引用

Journal of Circuits, Systems and computers 1995年第2期5卷 199-213页

作者： AMIYA NAYAK NICOLA SANTORO Center for Parallel & Distributed Computing School of Computer Science Carleton University Ottawa Canada K1S 5B6 Canada

A common technique to improve the reliability of loop (or ring) networks is by introducing link redundancy; that is, by providing several alternative paths for communication between pairs of nodes. With alternate paths between nodes, the network can now sustain several node and link failures by bypassing the faulty components. However, faults occurring at strategic locations in a ring can prevent the computation by disrupting I/O operations, blocking the flow of information, or even segmenting the structure into pieces which can no longer be suitable for any practical purpose. An extensive characterization of fault-tolerance in ring topologies is given in this paper. This characterization augments the results known in the literature to date. The characterization has revealed several properties which describe the problem of constructing subrings and linear arrays in the presence of node failures in the original ring for a specified link configuration. Also in this paper, bounds are established on the degree of fault tolerance achievable in a redundant loop network, with a given degree of redundancy, when performing a computation that requires a minimal number of operational nodes. Also the bounds on the size of the problems guaranteed to be solved in the presence of a given number of faults in the network are derived.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel AND distributed TLM COMPUTATION WITH SIGNAL-PROCESSING FOR ELECTROMAGNETIC-FIELD MODELING

引用

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 1995年第3-4期8卷 169-185页

作者： SO, PPM ESWARAPPA, C HOEFER, WJR NSERC/MPR Teltech Research Chair in RF Engineering Department of Electrical and Computer Engineering University of Victoria Victoria British Columbia V8W 3P6 Canada Poman So received his B.Sc. degree in computer science and physics from the University of Toronto Toronto Onatario Canada in 1985. He obtained his B.A. Sc. and M.A.Sc. degrees in electrical engineering (summa cum laude) from the University of Ottawa Ottawa Ontario Canada in 1987 and 1989 respectively. Mr So was a research engineer in the University of Ottawa from January 1989 to October 1991 his research interests included CAD techniques of microwave circuits and numerical methods for electromagnetic wave modelling. He specialized in the development of electromagnetic engineering CAD software and successfully implemented a number of electromagnetic wave simulators based on the two-dimensional and three-dimensional transmission-line matrix methods. From August 1990 to February 1991 he accompanied Professor W. J. R. Hoefer to Rome Italy and Sophia Antiopolas France. During that time he implemented a parallel version of the 3D-TLM simulator for the CM-2 Connection Machine using C-Star and X Windows Library. He is a research engineer and a Ph.D. student at the University of Victoria Victoria British Columbia Canada. He ported the 2D- and 3D-TLM simulators to DECmpp 1200 massively parallel computer using MPL C and C++. He also combined OSA90/hope a commercially available microwave CAD program with a 2D-TLM simulation module for geometry optimization using the Datapipe technique of OSA90/hope. Recently he has developed a distributed client-server computing technique for the TLM method this technique could accelerate the TLM simulation by more than an order of magnitude. Channabasappa Eswarappa received the M.Tech. degree in electrical engineering from the Indian Institute of Technology Kanpur India in 1983 and Ph. D. degree from the University of Ottawa Canada in 1990. He worked as an Assistant Executive Engineer and later as

This paper describes the implementation of transmission-line matrix (TLM) method algorithms on a massively parallel computer (DECmpp 12000), the technique of distributed computing in the UNIX environment, and the combination of TLM analysis with Prony's method as well as with autoregressive moving average (ARMA) digital signal processing for electromagnetic field modelling. By combining these advanced computation techniques, typical electromagnetic field modelling of microwave structures by TLM analysis can be accelerated by a few orders of magnitude.

关键词： Mathematical models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：