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

Annual Hawaii International Conference on System Sciences (HICSS)

作者： B. Sinharoy B.K. Szymanski Systems Technology and Architecture IBM Corporation Poughkeepsie NY USA Department of Computer Science Rensselaer Polytechnic Institute Troy NY USA

来源：评论

学校读者我要写书评

暂无评论

Time-deterministic WDM star network for massively parallel computing in radar systems

Time-deterministic WDM star network for massively parallel c...

引用

International Conference on Massively Parallel Processing Using Optical Interconnections

作者： M. Jonsson A. Ahlander M. Taveniku B. Svensson Centre for Computer Systems Architecture Halmstad University Halmstad Sweden Ericsson Microwave Systems AB Molndal Sweden Department of Computer Engineering Chalmers University of Technology Gothenburg Sweden

In massively parallel computer systems for embedded real-time applications there are normally very high bandwidth demands on the interconnection network. Other important properties are time-deterministic latency and services to guarantee that deadlines are met. In this paper we analyze how these properties vary with the design parameters for a passive optical star network, specifically when used in a massively parallel radar signal processing system. The aggregated bandwidth and computational power of the radar system are approximately 45 Gb/s and 100 GOPS, respectively. The analysis is focused on the medium access control protocol, called TD-TWDMA, for the time and wavelength multiplexed network. It is concluded that the proposed network is very well suited to this kind of signal-processing applications. We also present a new distributed slot-allocation algorithm with real-time properties.

关键词： Wavelength division multiplexing WDM networks Bandwidth computer networks Concurrent computing Embedded computing Real time systems Application software Multiprocessor interconnection networks Delay

来源：评论

学校读者我要写书评

暂无评论

Effects of multithreading on data and workload distribution for distributed-memory multiprocessors

Effects of multithreading on data and workload distribution ...

引用

International Symposium on Parallel Processing

作者： A. Sohn M. Sato Namhoon Yoo J.-L. Gaudiot Computer and Information Science Department New Jersey Institute of Technology Newark NJ USA Computer Architecture Section Electro Technical Laboratory Tsukuba Ibaraki Japan Department of EE-Systems University of Southern California Los Angeles CA USA

While data and workload distribution can be tailored to fit a particular problem to a particular distributed-memory architecture, it is often difficult to do so for various practical issues. This paper presents our study on multithreading for distributed-memory multiprocessors. Specifically, we investigate the effects of multithreading on data distribution and workload distribution with variable thread granularity. Various types of workload distribution strategies are defined along thread granularity. Three types of data distribution strategies are investigated: row-wise cyclic, k-way partial-row cyclic and blocked distribution. We have implemented all of these on the 80-processor EM-4 distributed-memory multiprocessor using highly-sequential Gaussian elimination with partial pivoting and highly-parallel matrix multiplication. Experimental results indicated that multithreading can offset the loss that is due to the mismatch of data distribution to workload distribution for even sequential and irregular problems while giving high absolute performance.

关键词： Multithreading Yarn Distribution strategy Performance loss

来源：评论

学校读者我要写书评

暂无评论

Identifying the capability of overlapping computation with communication

Identifying the capability of overlapping computation with c...

引用

International Conference on Parallel architecture and Compilation Techniques (PACT)

作者： A. Sohn J. Ku Y. Kodama M. Sato H. Sakane H. Yamana S. Sakai Y. Yamaguchi Computer and Information Science Department New Jersey Institute of Technology Newark NJ USA Computer Architecture Section Electro Technical Laboratory Tsukuba Ibaraki Japan Real World Computing Tsukuba Research Center Tsukuba Ibaraki Japan

Overlapping computation with communication is central to obtaining high performance on distributed-memory multiprocessors. This report explicates the overlapping capability of two distributed-memory multiprocessors: the EM-X and IBM SP-2. The well-known bitonic sorting algorithm is selected for experiments. Various message sizes are used to determine when, where, how much and why overlapping takes place. Experimental results indicate that both multiprocessors would yield up to 30% to 40% overlap of communication time when the message size is approximately 1K integers. EM-X is found to be message-size insensitive yielding high overlap for various message sizes, while SP-2 was effective for the window of message size 512 to 2K integers.

关键词： Delay computer architecture Switches Distributed computing High performance computing Sorting Prototypes Laboratories Yarn Windows

来源：评论

学校读者我要写书评

暂无评论

OptoElectronic technology Consortium (OETC) parallel optical data link: components, system applications, and simulation tools

OptoElectronic Technology Consortium (OETC) parallel optical...

引用

Electronic Components and technology Conference (ECTC)

作者： Y.M. Wong D.J. Muehlner C.C. Faudskar M. Fishteyn J.V. Gates P.J. Anthony G.J. Cyr J. Choi J.D. Crow D.M. Kuchta P.K. Pepeljugoski K. Stawiasz W. Nation D. Engebretsen B. Whitlock R.A. Morgan M.K. Hibbs-Brenner J. Lehman R. Walterson E. Kalweit T. Marta Lucent Technologies Bell Laboratories Murray Hill NJ USA Lucent Technologies Bell Laboratories Naperville IL USA IBM Thomas J. Watson Research Center Yorktown Heights NY USA IBM Systems Technology and Architecture Division Rochester MN USA University of Minnesota USA Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign Urbana IL USA Honeywell Technology Center Minneapolis MN USA

This paper discusses the present state of the art of components, systems, and application technology related to parallel optical data links (ODL) as demonstrated by the OptoElectronic technology Consortium (OETC). Parallel ODL technology is poised for large volume commercialization despite some uncertainties in industrial standards and system applications. This is fueled by the demand for high-bandwidth to support the upcoming information age. To meet the need for low-cost, broadband digital multimedia services, parallel ODL technology faces the challenge of providing reasonable cost/performance ratios when compared with other established technologies. Responding to this challenge has required the integration of a number of state-of-the-art component technologies (e.g. VCSEL, monolithic integrated photoreceiver, MCM, GaAs IC, optical array connector and cable) with system designs and applications.

关键词： Optical arrays Optical devices Commercialization Uncertainty Costs Vertical cavity surface emitting lasers Gallium arsenide Application specific integrated circuits Photonic integrated circuits Monolithic integrated circuits

来源：评论

学校读者我要写书评

暂无评论

Multi-dimensional partitioning for massively parallel database machines

Multi-dimensional partitioning for massively parallel databa...

引用

1995 Euromicro Workshop on Parallel and Distributed Processing

作者： Polo, A. Barrena, M. Hernández, J. Martínez, J.M. De Miguel, P. Nieto, M. Computer Science Department University of Extremadura Spain Architecture and Technology of Information Systems Department Technical University of Madrid Spain

ISBN: (纸本)0818670312

Harder, new requirements are appearing in the area of database systems. The popularity reached by parallel database systems during the past decade, due to their high performance and scalability characteristics, should be currently maintained and enhanced by including more powerful processing tools. In this paper we present a general technique for declustering data in a parallel relational database using multi-dimensional partitioning via m-Q-tree indexes. We propose the multiattribute index structure m-Q-tree as a new general access method which permits to exploit the potential parallelism of all relational operations, in addition to favor the execution of complex queries, including different kind of conditions on several attributes for one or more relations. © 1995 IEEE.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

A fiber-optic interconnection concept for scaleable massively parallel computing

A fiber-optic interconnection concept for scaleable massivel...

引用

International Conference on Massively Parallel Processing Using Optical Interconnections

作者： M. Jonsson K. Nilsson B. Svensson Centre for Computer Architecture Halmstad University Halmstad Sweden Department of Computer Engineering Chalmers University of Technology Goteborg Sweden

One of the most important features of interconnection networks for massively parallel computer systems is scaleability. The fiber-optic network described in this paper uses both wavelength division multiplexing and a configurable ratio between optics and electronics to gain an architecture with good scaleability. The network connects distributed modules together to a huge parallel system where each node itself typically consists of parallel processing elements. The paper describes two different implementations of the star topology, one uses an electronic star and fiber optic connections, the other is purely optical with a passive optical star in the center. The medium access control of the communication concept is presented and some scaleability properties are discussed involving also a multiple-star topology.

关键词： Optical fiber networks Circuit topology Multiprocessor interconnection networks computer networks Concurrent computing Wavelength division multiplexing Optical interconnections computer architecture Parallel processing Network topology

来源：评论

学校读者我要写书评

暂无评论

Multi-dimensional partitioning for massively parallel database machines

Multi-dimensional partitioning for massively parallel databa...

引用

Euromicro Workshop on Parallel and Distributed Processing

作者： A. Polo M. Barrena J. Hernandez J.M. Martinez P.De. Miguel M. Nieto Computer Science Department University of Extremadura Spain Architecture and Technology of Information Systems Department Technical University Madrid Spain

Harder, new requirements are appearing in the area of database systems. The popularity reached by parallel database systems during the past decade, due to their high performance and scalability

关键词： Database machines Database systems Scalability Relational databases Indexes Parallel processing Information retrieval computer science Hardware Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

SIMULTANEOUS PARALLEL REDUCTION ON SIMD MACHINES

引用

Parallel Processing Letters 1995年第3期5卷 437-449页

作者： BOLESLAW K. SZYMANSKI WILLIAM MANIATTY BALARAM SINHAROY Department of Computer Science Rensselaer Polytechnic Institute Troy NY 12180-3590 USA IBM Systems Technology and Architecture Division Poughkeepsie NY 12602 USA

Proper distribution of operations among parallel processors in a large scientific computation executed on a distributed-memory machine can significantly reduce the total computation time. In this paper, we propose an operation called simultaneous parallel reduction(SPR), that is amenable to such optimization. SPR performs reduction operations in parallel, each operation reducing a one-dimensional consecutive section of a distributed array. Each element of the distributed array is used as an operand to many reductions executed concurrently over the overlapping array's sections. SPR is distinct from a more commonly considered parallel reduction which concurrently evaluates a single reduction. In this paper we consider SPR on Single Instruction Multiple Data (SIMD) machines with different interconnection networks. We focus on SPR over sections whose size is not a power of 2 with the result shifted relative to the arguments. Several algorithms achieving some of the lower bounds on SPR complexity are presented under various assumptions about the properties of the binary operator of the reduction and of the communication cost of the target architectures.

关键词： Parallel reduction simultaneous evaluation data parallelism algorithm complexity scalability

来源：评论

学校读者我要写书评

暂无评论

New data-parallel language features for sparse matrix computations

New data-parallel language features for sparse matrix comput...

引用

International Symposium on Parallel Processing

作者： M. Ujaldon E.L. Zapata B.M. Chapman H.P. Zima Department of Computer Architecture University of Malaga Malaga Spain Institute for Soft. Technology and Parallel Systems University of Technology Vienna Vienna Austria

High level data parallel languages such as Vienna Fortran and High Performance Fortran (HPF) have been introduced to allow the programming of massively parallel distributed memory machines at a relatively high level of abstraction, based on the single program multiple data (SPMD) paradigm. Their main features include mechanisms for expressing the distribution of data across the processors of a machine. The paper introduces additional language functionality to allow the efficient processing of sparse matrix codes. It introduces methods for the representation and distribution of sparse matrices, which forms a powerful mechanism for storing and manipulating sparse matrices able to be efficiently implemented on massively parallel machines.< >

关键词： Sparse matrices Educational programs Finite element methods Image reconstruction Data structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：