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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

WADE: a Web-based automated parallel CAD environment

WADE: a Web-based automated parallel CAD environment

引用

International Conference on High Performance computing

作者： D.R. Chakrabarti P.G. Joisha J.A. Chandy D. Krishnaswamy V. Krishnaswamy P. Banerjee Center for Parallel and Distributed Computing Electrical and Computer Engineering Department Northwestern University Evanston IL USA Sierra Vista Research Inc. Los Gatos CA USA Intel Corporation Folsom CA USA Intel Corporation OR USA

We present a novel framework of a Web-based automated parallel CAD environment. The goal of this project is to make available to the CAD community a growing number of design and test applications that support standard interfaces and execute efficiently in a parallel environment. The design files of a user working on a remote machine are transparently shipped to the local Compute center, the relevant computation is performed in a parallel environment and then the results are returned back to the user. A job submission and scheduling tool ensures proper load balance and maximal usage of the various parallel machines. The whole process is done efficiently and transparently without the user having to bother about any low-level details. At present, a number of parallel CAD tools including a placement tool, a fault simulator and a VHDL simulator are supported. Results from a preliminary implementation are impressive and show the feasibility of the approach.

关键词： Design automation Concurrent computing Contracts Electrical capacitance tomography Software tools Pricing computer networks Circuits Cities and towns Testing

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing strategies for conservative parallel simulations 97

Dynamic load balancing strategies for conservative parallel ...

引用

Proceedings of the eleventh workshop on parallel and distributed simulation

作者： Azzedine Boukerche Sajal K. Das Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North of Texas Denton TX

ISBN: (纸本)9780818679650

This paper studies the problem of load balancing for conservative parallel simulations for execution on a multicomputer. The synchronization protocol makes use of Chandy-Misra null-messages. We propose a dynamic load balancing algorithm which assumes no compile time knowledge about the workload parameters. It is based upon a process migration mechanism, and the notion of CPU-queue length, which indicates the workload at each *** examine two variations for the algorithm which we refer to as centralized and multi-level hierarchical methods, in the context of queueing network simulation of a torus. The torus was chosen because it of its many cycles aid in the formation of deadlock making it a stress test for any conservative synchronization protocols. Our experiments indicate that our dynamic load balancing schemes significantly reduce the run time of an optimized version of Chandy-Misra null message approach, and decreases by 30-40\% the synchronization overhead when compared to the use of a static partitioning algorithm. Significantly, the results obtained also indicate that the multi-level scheme always outperforms both the centralized load balancing approach and the static partitioning algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A structured channel borrowing scheme for dynamic load balancing in cellular networks

A structured channel borrowing scheme for dynamic load balan...

引用

International Conference on distributed computing Systems

作者： S.K. Das S.K. Sen R. Jayaram Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas Denton TX USA

We propose an efficient dynamic load balancing scheme in cellular networks for managing a teletraffic hot spot in which channel demand exceeds a certain threshold. A hot spot, depicted as a stack of hexagonal 'ring' of cells, is classified as complete if all cells within it are hot. The rings containing only cold cells outside the hot spot are called 'peripheral rings'. Our load balancing scheme migrates channels through a structured borrowing mechanism from the cold cells within the 'rings' or 'peripheral rings' to the hot cells in the hot spot. For the more general case of an incomplete hot spot, a cold cell is further classified as cold safe, cold semi-safe or cold unsafe, and a demand graph is constructed from the channel demand of each hot cell from its adjacent cells in the next outer ring. The channel borrowing algorithm works on the demand graph in a bottom up fashion, satisfying the demands of the cells in each subsequent inner ring. Markov chain models are developed for a hot cell and detailed simulation experiments are conducted to evaluate the performance of our load balancing scheme. Comparison with an existing load balancing strategy under moderate and heavy teletraffic conditions, shows a performance improvement of 12% in terms of call blockade by our load balancing scheme.

关键词： Load management Intelligent networks Land mobile radio cellular systems Frequency distributed computing Base stations computer networks Concurrent computing Electronic mail computer network management

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing strategies for conservative parallel simulations

Dynamic load balancing strategies for conservative parallel ...

引用

Workshop on Principles of Advanced and distributed Simulation (PADS)

作者： A. Boukerche S.K. Das Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas Denton TX USA

This paper studies the problem of load balancing for conservative parallel simulations for execution on a multicomputer. The synchronization protocol makes use of Chandy-Misra (1979) null-messages. We propose a dynamic load balancing algorithm which assumes no compile time knowledge about the workload parameters. It is based upon a process migration mechanism, and the notion of CPU-queue length, which indicates the workload at each processor. We examine two variations for the algorithm which we refer to as centralized and multi-level hierarchical methods, in the context of queueing network simulation of a torus. The torus was chosen because its many cycles aid in the formation of deadlock, making it a stress test for any conservative synchronization protocols. Our experiments indicate that our dynamic load balancing schemes significantly reduce the run time of an optimized version of Chandy-Misra null message approach, and decreases by 30-40% the synchronization overhead when compared to the use of a static partitioning algorithm. Significantly, the results obtained also indicate that the multi-level scheme always outperforms both the centralized load balancing approach and the static partitioning algorithm.

关键词： Load management Computational modeling Protocols distributed computing Stress Testing Partitioning algorithms Discrete event simulation computer simulation Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Adaptive blocks: A high performance data structure 97

Adaptive blocks: A high performance data structure

引用

1997 ACM/IEEE Conference on Supercomputing, SC 1997

作者： Stout, Quentin F. De Zeeuw, Darren L. Gombosi, Tamas I. Groth, Clinton P. T. Marshall, Hal G. Powell, Kenneth G. Electrical Engineering and Computer Science Center for Parallel Computing University of Michigan Ann Arbor MI 48109-2122 United States Space Physics Research Laboratory Department of Atmospheric Oceanic and Space Sciences University of Michigan Ann Arbor MI 48109-2143 United States Laboratory for Scientific Computation Center for Parallel Computing University of Michigan Ann Arbor MI 48109-2094 United States Department of Aerospace Engineering University of Michigan Ann Arbor MI 48109-2118 United States

ISBN: (纸本)0897919858

We examine a data structure which uses flexible "adaptivity" to obtain high performance for both serial and parallel computers. The data structure is an adaptive grid which partitions a given region into regular cells. Its closest relatives are cell-based tree decompositions, but there are several important differences which lead to significant performance advantages. Using this block data structure to support adaptive mesh refinement (AMR), we were able to sustain 17 GFLOPS in ideal magnetohydrodynamic (MHD) simulations of the solar wind emanating from the base of the solar corona, using a 512 processor Cray T3D at NASA Goddard. © 1997 ACM.

关键词： Magnetohydrodynamics

来源：评论

学校读者我要写书评

暂无评论

A dynamic load balancing strategy for channel assignment using selective borrowing in cellular mobile environment 96

A dynamic load balancing strategy for channel assignment usi...

引用

Proceedings of the 2nd annual international conference on Mobile computing and networking

作者： Sajal K. Das Sanjoy K. Sen Rajeev Jayaram Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas P.O. Box 13886 Denton TX

来源：评论

学校读者我要写书评

暂无评论

A reliable, adaptive network protocol for video transport

A reliable, adaptive network protocol for video transport

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： P. Goyal H.M. Vin C. Shen P.J. Shenoy Distributed Multimedia Computing Laboratory Department of Computer Sciences UT Austin Austin TX USA Cambridge Research Center Mitsubishi Electric Research Laboratory Cambridge MA USA

We present an adaptive network layer protocol for VBR video transport. It: (1) minimizes the buffer requirement in the network while guaranteeing that packets of VBR encoded video flows will not be lost, and (2) minimizes the end-to-end delay and jitter of frames. To achieve the former objective, we utilize a receiver-oriented adaptive credit-based flow control algorithm, and derive the necessary and sufficient number of buffers that should be reserved for ensuring its reliability. To minimize the end-to-end delay and jitter for VBR encoded video streams, we: (1) present bandwidth estimation techniques which exploit the structure of the video traffic, and (2) define a new fairness criteria for buffer allocation and then present a fair buffer/bandwidth allocation algorithm. We experimentally evaluate this protocol for a wide range of parameters and many network configurations, and demonstrate its adaptability. We also compare the performance of the protocol with numerous other schemes and demonstrate its suitability for video transport.

关键词： Adaptive systems Transport protocols Jitter Delay estimation Programmable control Adaptive control Streaming media Bandwidth Communication system traffic control Channel allocation

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel Algorithms for Pattern Recognition

引用

parallel Algorithms and Applications 1994年第1-2期2卷 81-98页

作者： Das, Sajal K Fisher, Paul S Zhang, Hua Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas Denton TX 76203-6886 United States

Finitely inductive (F1) sequences are a class of sequences, finite or infinite, which are amenable to a certain mathematical representation which has direct significance to pattern recognition and string matching. Pattern recognition using the Fl technique first transforms known patterns into function table(s) by factoring, and then uses the function table(s) to match an input pattern by following. Factoring is done off line and only once for each pattern. The sequential time for matching two sequences depends only upon the length of the input sequence. In this paper, we propose cost-optimal (i.e., efficient) parallel algorithms for FI sequence processing. These algorithms include parallel factoring and following by bucket packing on an exclusive-read and exclusive-write (EREW), parallel random access machine (PRAM) model. The proposed algorithms also have implications lo parallel integer sorting. © 1994, Taylor & Francis Group, LLC. All rights reserved.

关键词： Finitely inductive sequences Integer sorting parallel algorithms Pattern recognition String matching

来源：评论

学校读者我要写书评

暂无评论

MANIPULATIONS OF OCTREES AND QUADTREES ON MULTIPROCESSORS

引用

International Journal of Pattern Recognition and Artificial Intelligence 1994年第2期8卷 439-455页

作者： VIPIN CHAUDHARY K. KUMARI P. ARUNACHALAM J.K. AGGARWAL Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI 48202 USA Sun Microsystems 2820 Orchard Parkway San Jose CA 95134 USA Computer and Vision Research Center Department of Electrical and Computer Engineering University of Texas at Austin Austin Texas 78712–1084 USA

Octrees offer a powerful means for representing and manipulating 3-D objects. This paper presents an implementation of octree manipulations using a new approach on a shared memory architecture. Octrees are hierarchical data structures used to model 3-D objects. The manipulation of these data structures involves performing independent computations on each node of the octree. Octrees are much easier to deal with than other forms of representations used to model 3-D objects especially where extensive manipulations are involved. When these operations are distributed among multiple processing elements (PEs) and executed simultaneously, a significant speedup may be achieved. Manipulations such as a complement, a union, an intersection and other operations such as finding the volume and centroid which this paper describes are implemented on the Sequent Balance multiprocessor. In this approach the PEs are allocated dynamically, resulting in a uniform load balancing among them. The experimental results presented illustrate the feasibility of the approach. Although this evaluation has been originally done for shared memory machines, it will provide insight for the evaluation of other architectures.

关键词： Shared memory architecture dynamic allocation union intersection orthogonal views

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：