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

Synthesizing variable instruction issue interpreters for implementing functional parallelism on simd computers

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1997年第4期8卷 412-423页

作者： AbuGhazaleh, NB Wilsey, PA Fan, XZ Hensgen, DA USN POSTGRAD SCHDEPT COMP SCIMONTEREYCA 93943

Functional parallelism can be supported on simd machines by interpretation. Under such a scheme, the programs and data of each task are loaded on the processing elements (PEs) and the Control Unit of the machine executes a central control algorithm that causes the concurrent interpretation of the tasks on the PEs. The central control algorithm is, in many respects, analogous to the control store program on microprogrammed machines. Accordingly, the organization of the control algorithm greatly influences the performance of the synthesized MIMD environment. Most central control algorithms are constructed to interpret the execution phase of all instructions during every cycle (iteration). However, it is possible to delay the interpretation of infrequent and costly instructions to improve the overall performance. Interpreters that attempt improved performance by delaying the issue of infrequent instructions are referred to as variable issue control algorithms. This paper examines the construction of optimized variable issue control algorithms. In particular, a mathematical model for the interpretation process is built and two objective functions (instruction throughput and PE utilization) are defined. The problem of deriving variable issue control algorithms for these objective functions has been shown elsewhere to be NP-complete. Therefore, this paper investigates three heuristic algorithms for constructing near optimal variable issue control algorithms. The performance of the algorithms is studied on four different instruction sets and the trends of the schedulers with respect to the instruction sets and the objective functions are analyzed.

关键词： MIMD on simd interpretation variable instruction issue scheduling instruction execution simd computers

来源：评论

学校读者我要写书评

暂无评论

MAPPING QR DECOMPOSITION ON PARALLEL computers - A STUDY CASE FOR RADAR APPLICATIONS

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 1994年第10期E77B卷 1264-1271页

作者： DACIERNO, A CECCARELLI, M FARINA, A PETROSINO, A TIMMONERI, L ALENIA AERITALIA & SELENIA DEPT RADAR ENGN RADAR SYST ANAL GRP I-00131 ROME ITALY

The sidelobe canceler in radar systems is a highly computational demanding problem. It can be efficiently tackled by resorting to the QR decomposition mapped onto a systolic array processor. The paper reports several mapping strategies by using massive parallel computers available on the market. MIMD as well as simd machines have been used, specifically MEIKO Computing Surface, nCUBE2, Connection Machine CM-200, and MasPar MP-1. The achieved data throughput values have been measured for a number of operational situations of practical interest.

关键词： RADAR SIDELOBE CANCELER QR DECOMPOSITION PARALLEL PROCESSING SYSTOLIC ARRAY MIMD computers simd computers

来源：评论

学校读者我要写书评

暂无评论

ORDER-STATISTICS ON OPTICALLY INTERCONNECTED MULTIPROCESSOR SYSTEMS

引用

OPTICS AND LASER TECHNOLOGY 1994年第4期26卷 281-287页

作者： PAN, Y The author is in the Department of Computer Science University of Dayton Dayton OH 45469-2160 USA

Processor arrays with an optical bus are introduced for parallel computation in this paper. We use the order statistics problem as an example to demonstrate how to design efficient parallel algorithms on such systems. Besides proposing a new algorithm on the model, some basic data movement operations involved in the algorithm are discussed. We believe that these operations can be used to design other parallel algorithms on the same model. Time analysis indicates that order statistics can be done more efficiently on a linear array with a pipelined optical bus than with an electronic bus. The initial results are promising, and the author believes that optical buses may emerge as a powerful communication mechanism for connecting large parallel computer systems in the near future.

关键词： PIPELINED OPTICAL BUSES PARALLEL ALGORITHMS simd computers

来源：评论

学校读者我要写书评

暂无评论

TOWARDS FIRST-PRINCIPLES THEORIES OF MATERIALS AND BIOLOGICAL-SYSTEMS - THE NEED FOR MASSIVE PARALLELISM

引用

FUTURE GENERATION COMPUTER SYSTEMS 1994年第2-3期10卷 331-338页

作者： WILLE, LT ROGERS, JL BURMESTER, CP GRONSKY, R UNIV CALIF BERKELEY DEPT MAT SCI & MINERAL ENGNBERKELEYCA 94720 UNIV CALIF BERKELEY LAWRENCE BERKELEY LABDIV MAT SCIBERKELEYCA 94720

The first-principles paradigm, i.e. the calculation of a physical, chemical, or biological system's properties without including any fitted or adjustable parameters, is one of the most powerful in the scientist's quest to understand nature. Unfortunately most first-principles computations involve quite complicated governing equations and large system sizes, both of which have a detrimental effect on memory size and computer time requirements. Using two relatively simple yet realistic models, one in materials science and one in biophysics, it is discussed here how massive parallelism can make such studies feasible.

关键词： MASSIVELY PARALLEL COMPUTING simd computers MATERIALS SCIENCE BIOPHYSICS PARALLEL MONTE CARLO SIMULATION CHAOS

来源：评论

学校读者我要写书评

暂无评论

PARALLEL CONTEXT-SENSITIVE COMPILATION

引用

SOFTWARE-PRACTICE & EXPERIENCE 1994年第9期24卷 801-822页

作者： ASTHAGIRI, CR POTTER, JL KENT STATE UNIV DEPT MATH & COMP SCIKENTOH 44242

The searching power of massively parallel associative computers is an under used and under investigated capability that can be used to facilitate software development. This paper describes the development of a context sensitive compiler for pattern-matching languages using that searching power. The described compiler was implemented on the STARAN parallel computer and the compiled OPS5 programs were also executed on the STARAN obtaining an estimated throughput of 6000 rules per second. The described compilation of production rules into equivalent procedural rules is completely data parallel, with the degree of parallelism depending on the number of tokens in the program being compiled. During any one step of the context-sensitive analysis, the entire program is processed in constant time.

关键词： CONTEXT-SENSITIVE COMPILATION MASSIVE PARALLELISM ASSOCIATIVE PROCESSING simd computers PATTERN MATCHING

来源：评论

学校读者我要写书评

暂无评论

DATA REDUCTION AND FAST ROUTING - A STRATEGY FOR EFFICIENT ALGORITHMS FOR MESSAGE-PASSING PARALLEL computers

引用

ALGORITHMICA 1992年第1期7卷 77-89页

作者： SANZ, JLC CYPHER, R 1. Department K54/802 IBM Almaden Research Center 650 Harry Road 95120 San Jose CA USA

This paper presents several algorithms for solving problems using massively parallel simd hypercube and shuffle-exchange computers. The algorithms solve a wide variety of problems, but they are related because they all use a common strategy. Specifically, all of the algorithms use a divide-and-conquer approach to solve a problem with N inputs using a parallel computer with P processors. The structural properties of the problem are exploited to assure that fewer than N data items are communicated during the division and combination steps of the divide-and-conquer algorithm. This reduction in the amount of data that must be communicated is central to the efficiency of the algorithm. This paper addresses four problems, namely the multiple-prefix, data-dependent parallel-prefix, image-component-labeling, and closest-pair problems. The algorithms presented for the data-dependent parallel-prefix and closest-pair problems are the fastest known when N greater-than-or-equal-to P and the algorithms for the multiple-prefix and image-component-labeling problems are the fastest known when N is sufficiently large with respect to P.

关键词： PARALLEL ALGORITHMS simd computers HYPERCUBES ROUTING

来源：评论

学校读者我要写书评

暂无评论

ACHIEVING SPEEDUPS FOR APL ON AN simd DISTRIBUTED MEMORY MACHINE

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 1990年第2期19卷 111-127页

作者： GREENLAW, R SNYDER, L UNIV NEW HAMPSHIRE DEPT COMP SCIDURHAMNH 03824 UNIV WASHINGTON DEPT COMP SCI & ENGNSEATTLEWA 98195

The potential speedup for simd parallel implementations of APL programs is considered. Both analytical and (simulated) empirical studies are presented. The approach is to recognize that nearly 95% of the operators appearing in APL programs are either scalar primitive, reduction or indexing and so the performance of these operators gives a good estimate of the amount of speedup a full program might receive. Substantial speedups are demonstrated for these operators and the empirical evidence accords with the analytical estimates.

关键词： APL DATA PARALLEL PARALLELISM PARALLEL PROGRAMMING simd computers

来源：评论

学校读者我要写书评

暂无评论

PERMUTATIONS ON ILLIAC-IV-TYPE NETWORKS

引用

IEEE TRANSACTIONS ON computers 1986年第7期35卷 662-669页

作者： RAGHAVENDRA, CS KUMAR, VKP Department of Electrical Engineering—Systems University of Southern California

Performing permutations of data on simd computers efficiently is important for high-speed execution of parallel algorithms. In this correspondence we consider realizing permutations such as perfect shuffle, matrix transpose, bit-reversal, the class of bit-permute- complement (BPC), the class of Omega, and inverse Omega permutations on N = 2n processors with Illiac IV-type interconnection network, where each processor is connected to processors at distances of ± 1 and ± N. The minimum number of data transfer operations required for realizing any of these permutations on such a network is shown to be 2(N − 1). We provide a general three-phase strategy for realizing permutations and derive routing algorithms for performing perfect shuffle, Omega, Inverse Omega, bit reversal, and matrix-transpose permutations in 2(N − 1) steps. Our approach is quite simple, and unlike previous approaches, makes efficient use of the topology of the Illiac IV-type network to realize these permutations using the optimum number of data transfers. Our strategy is quite powerful: any permutation can be realized using this strategy in 3(N − 1) steps.

关键词： Bit-permute-complement permutations Omega permutations simd computers interconnection network parallel algorithms permutations

来源：评论

学校读者我要写书评

暂无评论

simd MATRIX-METHODS FOR DETECTING HAZARDS IN LOGIC-CIRCUITS

引用

IEE PROCEEDINGS-E computers AND DIGITAL TECHNIQUES 1993年第4期140卷 201-204页

作者： HEAL, BW PAGE, RMR Department of Information Science University of Portsmouth Portsmouth UK

The paper describes the underlying theory and an outline for an algorithm which is designed to utilise the power of simd computers to detect and locate the presence of logic hazards in combinational logic circuits.

关键词： COMBINATORIAL LOGIC CIRCUITS ALGORITHMS simd computers MATRIX ALGEBRA HAZARDS

来源：评论

学校读者我要写书评

暂无评论

On evil twin networks and the value of limited randomized routing

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2000年第9期11卷 910-925页

作者： Alleyne, BD Scherson, ID PMC Sierra Inc San Jose CA 95110 USA Univ Calif Irvine Dept Informat & Comp Sci Irvine CA 92697 USA Univ Calif Irvine Dept Elect & Comp Engn Irvine CA 92697 USA

A dynamic two-stage Delta network (N inputs and outputs) is introduced and analyzed for permutation routing. The notion of evil twins is introduced and a deterministic procedure is given to route any permutation in no more than 2(1)rootN network cycles. Two limited randomized routing schemes are then analyzed. The first called Single Randomization yields on average at most N (!) over bar + 1 + 1/N (N (!) over bar = O(log N/log log N)(1) and is the greatest integer such that (N (!) over bar) less than or equal to N) network cycles and the second called Multiple Randomization yields on average at most right perpendicular log(log N + 1) left perpendicular + 2 +1/N network cycles for any input permutation. The probability of any permutation requiring at least c network cycles more than the above average bounds is then shown to be at most 1/(c+1)! for Single Randomization and 1/N-2 for Multiple Randomization, respectively. It is then shown how the dynamic two-stage network can be physically realized as a three-stage network. Both the evil twin and Multiple Randomization algorithms have been integrated into an off-the-shelf ASIC from PMC-Sierra, Inc. (PM-73488) which has been designed as a building block for such a three-stage implementation. These routing schemes are also adapted to run on a recirculating network. Recirculation is used to effect a reshuffling of data as in the dynamic network, but with a considerable reduction in network cost.

关键词： multistage interconnection networks (MINs) permutation routing Clos networks Delta networks randomized routing recirculating networks simd computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：