DOCSLIB.ORG

A High-Performance Connected Components Implementation for Gpus

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A High-Performance Connected Components Implementation for Gpus A High-Performance Connected Components Implementation for GPUs Jayadharini Jaiganesh Martin Burtscher Department of Computer Science Department of Computer Science Texas State University Texas State University San Marcos, TX 78666, USA San Marcos, TX 78666, USA [email protected] [email protected] ABSTRACT 1 INTRODUCTION Computing connected components is an important graph algo- A connected component of an undirected graph G = (V, E) is a rithm that is used, for example, in medicine, image processing, and maximal subset S of its vertices that are all reachable from each biochemistry. This paper presents a fast connected-components other. In other words, a, b S there exists a path between a and implementation for GPUs called ECL-CC. It builds upon the best b. The subset is maximal, i.e., no vertices are reachable from it that features of prior algorithms and augments them with GPU-spe- are not in the subset. The goal of the connected-components (CC) cific optimizations. For example, it incorporates a parallelism- algorithms we study in this paper is to identify all such subsets friendly version of pointer jumping to speed up union-find oper- and label each vertex with the ID of the component to which it ations and uses several compute kernels to exploit the multiple belongs. A non-empty graph must have at least one connected levels of hardware parallelism. The resulting CUDA code is asyn- component and can have as many as n, where n = |V|. chronous and lock free, employs load balancing, visits each edge For illustration purposes, assume the cities on Earth are the exactly once, and only processes edges in one direction. It is 1.8 vertices of a graph and the roads connecting the cities are the times faster on average than the fastest prior GPU implementation edges. In this example, the road network of an island without running on a Titan X and faster on most of the eighteen real-world bridges to it forms a connected component. and synthetic graphs we tested. Computing connected components is a fundamental graph al- gorithm with applications in many fields. For instance, in medi- CCS Concepts cine, it is used for cancer and tumor detection (the malignant cells are connected to each other) [16]. In computer vision, it is used • Computing methodologies → Concurrent algorithms; Mas- for object detection (the pixels of an object are typically con- sively parallel algorithms nected) [14]. In biochemistry, it is used for drug discovery and protein genomics studies (interacting proteins are connected in Keywords the PPI network) [39]. Fast CC implementations, in particular par- connected components; graph algorithm; union-find; parallelism; allel implementations, are desirable to speed up these and other GPU implementation important computations. Determining CCs serially is straightforward using the follow- ACM Reference format: ing algorithm. After marking all vertices as unvisited, visit them J. Jaiganesh and M. Burtscher. 2018. A High-Performance Connected Com- in any order. If a visited vertex is still marked as unvisited, use it ponents Implementation for GPUs. In Proceedings of the International ACM as the source of a depth-first search (DFS) or breadth-first search Symposium on High-Performance Parallel and Distributed Computing, (BFS) during which all reached vertices are marked as visited and Tempe, Arizona USA, June 2018 (HPDC’18), 13 pages. DOI: 10.1145/3208040.3208041 their labels are set to the unique ID of the source vertex. This takes O(n+m) time, where m = |E|, as each vertex must be visited and each edge traversed. Alternatively, CCs can be found with the following serial al- Permission to make digital or hard copies of all or part of this work for personal or class- gorithm. First, iterate over all vertices and place each of them in a room use is granted without fee provided that copies are not made or distributed for separate disjoint set using the vertex’s ID as the representative profit or commercial advantage and that copies bear this notice and the full citation on (label) of the set. Then, visit each edge (u, v) and combine the set the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post to which vertex u belongs with the set to which vertex v belongs. on servers or to redistribute to lists, requires prior specific permission and/or a fee. Re- This algorithm returns a collection of sets where each set is a con- quest permissions from [email protected]. nected component of the graph. Determining which set a vertex HPDC '18, June 11–15, 2018, Tempe, AZ, USA belongs to and combining it with another set can be done very © 2018 Association for Computing Machinery. ACM ISBN 978-1-4503-5785-2/18/06…$15.00 efficiently using a disjoint-set data structure (aka a union-find https://doi.org/10.1145/3208040.3208041 data structure) [9]. Asymptotically, this algorithm is only slower than the DFS/BFS-based algorithm by the tiny factor α(n), i.e., the Fig. 1 illustrates the parallel label-propagation approach out- inverse of the Ackermann function. lined in the introduction, where the labels are propagated through Whereas there are efficient parallel implementations that are neighboring vertices until all vertices in the same component are based on the BFS approach, for example Ligra+ BFSCC [31], the labelled with the same ID. First, the labels (small digits) are initial- majority of the parallel CC algorithms are based on the following ized with the unique vertex IDs (large digits) as shown in panel “label propagation” approach. Each vertex has a label to hold the (a). Next, each vertex’s label is updated in parallel with the lowest component ID to which it belongs. Initially, this label is set to the label among the neighboring vertices and itself (b). This step is vertex ID, that is, each vertex is considered a separate component, iterated until all labels in the component have the same value (c). which can trivially be done in parallel. Then the vertices are iter- atively processed in parallel to determine the connected compo- nents. For instance, each vertex’s label can be updated with the smallest label among its neighbors. This process repeats until there are no more updates, at which point all vertices in a con- nected component have the same label. In this example, the ID of (a) (b) (c) the minimum vertex in each component serves as the component ID, which guarantees uniqueness. To speed up the computation, Fig. 1. Example of label propagation (large digits are unique ver- the labels are often replaced by “parent” pointers that form a un- tex IDs, small digits are label values): (a) initial state, (b) interme- ion-find data structure. diate state, (c) final state Our ECL-CC implementation described in this paper is based For performance reasons, the labels are typically not propa- on this approach. However, ECL-CC combines features and opti- gated in this manner. Instead, they are indirectly represented by a mizations in a new and unique way to yield a very fast GPU im- parent pointer in each vertex that, together, form a union-find plementation. The paper makes the following main contributions. data structure. Starting from any vertex, we can follow the parent • It presents the ECL-CC algorithm for finding and labeling pointers until we reach a vertex that points to itself. This final the connected components of an undirected graph. Its par- vertex is the “representative”. Every vertex’s implicit label is the allel GPU implementation is faster than the fastest prior CPU and GPU codes on average and on most of the eighteen ID of its representative and, as before, all vertices with the same tested graphs. label (aka representative) belong to the same component. Thus, • It shows that “intermediate pointer jumping”, an approach making the representative u point to v indirectly changes the la- to speed up the find operation in union-find computations, bels of all vertices whose representative used to be u. This makes is faster than other pointer-jumping versions and essential union operations very fast. A chain of parent pointers leading to a to the performance of our GPU implementation. representative is called a “path”. To also make the traversals of • It describes important code optimizations for CC computa- these paths, i.e., the find operations, very fast, the paths are spo- tions that are necessary for good performance but that have radically shortened by making earlier elements skip over some el- heretofore never been combined in the way ECL-CC does. ements and point directly to later elements. This process is re- The CUDA code is available to the research and education com- ferred to as “path compression”. munity at http://cs.txstate.edu/~burtscher/research/ECL-CC/. The rest of the paper is organized as follows. Section 2 provides background information and discusses related work. Section 3 de- scribes the ECL-CC implementation. Section 4 explains the evalu- ation methodology. Section 5 presents the experimental results. Section 6 concludes the paper with a summary. 2 BACKGROUND AND RELATED WORK A large amount of related work exists on computing connected (a) (b) components. In this section, we primarily focus on the shared- Fig. 2. Example of hooking operation: (a) before hooking, (b) after memory solutions that we compare against in the result section hooking as well as the work on which they are based. This paper does not consider strongly connected components as they are of interest in Shiloach and Vishkin proposed one of the first parallel CC al- directed graphs.
Load more

Recommended publications
  • Vertex Coloring
    Lecture 1 Vertex Coloring 1.1 The Problem Nowadays multi-core computers get more and more processors, and the question is how to handle all this parallelism well. So, here's a basic problem: Consider a doubly linked list that is shared by many processors. It supports insertions and deletions, and there are simple operations like summing up the size of the entries that should be done very fast. We decide to organize the data structure as an array of dynamic length, where each array index may or may not hold an entry. Each entry consists of the array indices of the next entry and the previous entry in the list, some basic information about the entry (e.g. its size), and a pointer to the lion's share of the data, which can be anywhere in the memory. Memory structure Logical structure 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 next previous size data Figure 1.1: Linked listed after initialization. Blue links are forward pointers, red links backward pointers (these are omitted from now on). We now can quickly determine the total size by reading the array in one go from memory, which is quite fast. However, how can we do insertions and deletions fast? These are local operations affecting only one list entry and the pointers of its \neighbors," i.e., the previous and next list element. We want to be able to do many such operations concurrently, by different processors, while maintaining the link structure! Being careless and letting each processor act independently invites desaster, see Figure 1.3.
    [Show full text]
  • Easy PRAM-Based High-Performance Parallel Programming with ICE∗
    Easy PRAM-based high-performance parallel programming with ICE∗ Fady Ghanim1, Uzi Vishkin1,2, and Rajeev Barua1 1Electrical and Computer Engineering Department 2University of Maryland Institute for Advance Computer Studies University of Maryland - College Park MD, 20742, USA ffghanim,barua,[email protected] Abstract Parallel machines have become more widely used. Unfortunately parallel programming technologies have advanced at a much slower pace except for regular programs. For irregular programs, this advancement is inhibited by high synchronization costs, non-loop parallelism, non-array data structures, recursively expressed parallelism and parallelism that is too fine-grained to be exploitable. We present ICE, a new parallel programming language that is easy-to-program, since: (i) ICE is a synchronous, lock-step language; (ii) for a PRAM algorithm its ICE program amounts to directly transcribing it; and (iii) the PRAM algorithmic theory offers unique wealth of parallel algorithms and techniques. We propose ICE to be a part of an ecosystem consisting of the XMT architecture, the PRAM algorithmic model, and ICE itself, that together deliver on the twin goal of easy programming and efficient parallelization of irregular programs. The XMT architecture, developed at UMD, can exploit fine-grained parallelism in irregular programs. We built the ICE compiler which translates the ICE language into the multithreaded XMTC language; the significance of this is that multi-threading is a feature shared by practically all current scalable parallel programming languages. Our main result is perhaps surprising: The run-time was comparable to XMTC with a 0.48% average gain for ICE across all benchmarks. Also, as an indication of ease of programming, we observed a reduction in code size in 7 out of 11 benchmarks vs.
    [Show full text]
  • Instructor's Manual
    Instructor’s Manual Vol. 2: Presentation Material CCC Mesh/Torus Butterfly !*#? Sea Sick Hypercube Pyramid Behrooz Parhami This instructor’s manual is for Introduction to Parallel Processing: Algorithms and Architectures, by Behrooz Parhami, Plenum Series in Computer Science (ISBN 0-306-45970-1, QA76.58.P3798) 1999 Plenum Press, New York (http://www.plenum.com) All rights reserved for the author. No part of this instructor’s manual may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, microfilming, recording, or otherwise, without written permission. Contact the author at: ECE Dept., Univ. of California, Santa Barbara, CA 93106-9560, USA ([email protected]) Introduction to Parallel Processing: Algorithms and Architectures Instructor’s Manual, Vol. 2 (4/00), Page iv Preface to the Instructor’s Manual This instructor’s manual consists of two volumes. Volume 1 presents solutions to selected problems and includes additional problems (many with solutions) that did not make the cut for inclusion in the text Introduction to Parallel Processing: Algorithms and Architectures (Plenum Press, 1999) or that were designed after the book went to print. It also contains corrections and additions to the text, as well as other teaching aids. The spring 2000 edition of Volume 1 consists of the following parts (the next edition is planned for spring 2001): Vol. 1: Problem Solutions Part I Selected Solutions and Additional Problems Part II Question Bank, Assignments, and Projects Part III Additions, Corrections, and Other Updates Part IV Sample Course Outline, Calendar, and Forms Volume 2 contains enlarged versions of the figures and tables in the text, in a format suitable for use as transparency masters.
    [Show full text]
  • Lawrence Berkeley National Laboratory Recent Work
    Lawrence Berkeley National Laboratory Recent Work Title Parallel algorithms for finding connected components using linear algebra Permalink https://escholarship.org/uc/item/8ms106vm Authors Zhang, Y Azad, A Buluç, A Publication Date 2020-10-01 DOI 10.1016/j.jpdc.2020.04.009 Peer reviewed eScholarship.org Powered by the California Digital Library University of California Parallel Algorithms for Finding Connected Components using Linear Algebra Yongzhe Zhanga, Ariful Azadb, Aydın Buluc¸c aDepartment of Informatics, The Graduate University for Advanced Studies, SOKENDAI, Japan bDepartment of Intelligent Systems Engineering, Indiana University, Bloomington, IN, USA cComputational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA, USA Abstract Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computation. This paper presents a class of parallel connected-component algorithms designed using linear-algebraic primitives. These algorithms are based on a PRAM algorithm by Shiloach and Vishkin and can be designed using standard GraphBLAS operations. We demonstrate two algorithms of this class, one named LACC for Linear Algebraic Connected Components, and the other named FastSV which can be regarded as LACC’s simplification. With the support of the highly-scalable Combinatorial BLAS library, LACC and FastSV outperform the previous state-of-the-art algorithm by a factor of up to 12x for small to medium scale graphs. For large graphs with more than 50B edges, LACC and FastSV scale to 4K nodes (262K cores) of a Cray XC40 supercomputer and outperform previous algorithms by a significant margin.
    [Show full text]
  • PRAM Algorithms Parallel Random Access Machine
    PRAM Algorithms Arvind Krishnamurthy Fall 2004 Parallel Random Access Machine (PRAM) n Collection of numbered processors n Accessing shared memory cells Control n Each processor could have local memory (registers) n Each processor can access any shared memory cell in unit time Private P Memory 1 n Input stored in shared memory cells, output also needs to be Global stored in shared memory Private P Memory 2 n PRAM instructions execute in 3- Memory phase cycles n Read (if any) from a shared memory cell n Local computation (if any) Private n Write (if any) to a shared memory P Memory p cell n Processors execute these 3-phase PRAM instructions synchronously 1 Shared Memory Access Conflicts n Different variations: n Exclusive Read Exclusive Write (EREW) PRAM: no two processors are allowed to read or write the same shared memory cell simultaneously n Concurrent Read Exclusive Write (CREW): simultaneous read allowed, but only one processor can write n Concurrent Read Concurrent Write (CRCW) n Concurrent writes: n Priority CRCW: processors assigned fixed distinct priorities, highest priority wins n Arbitrary CRCW: one randomly chosen write wins n Common CRCW: all processors are allowed to complete write if and only if all the values to be written are equal A Basic PRAM Algorithm n Let there be “n” processors and “2n” inputs n PRAM model: EREW n Construct a tournament where values are compared P0 Processor k is active in step j v if (k % 2j) == 0 At each step: P0 P4 Compare two inputs, Take max of inputs, P0 P2 P4 P6 Write result into shared memory
    [Show full text]
  • CSE 4351/5351 Notes 9: PRAM and Other Theoretical Model S
    CSE 4351/5351 Notes 9: PRAM and Other Theoretical Model s Shared Memory Model Traditional Sequential Algorithm Model RAM (Random Access Machine) Uniform access time to memory Arithmetic operations performed in O(1) time (simplification, really O(lg n)) Generalization of RAM to Parallel Computation PRAM (Parallel Random Access Machine) SHARED MEMORY P0 P1 P2 P3 . Pn FAMILY of models - different concurrency assumptions imply DRASTIC differences in hardware/software support or may be impossible to physically realize. MAJOR THEORETICAL ISSUE: What is the penalty for modifying an algorithm in a flexible model to satisfy a restrictive model? MAJOR PRACTICAL ISSUES: Adequacy for mapping to popular topologies. Developing topologies/algorithms to support models with minimum penalty. Other models: Valiant's BSP (bulk-synchronous parallel), CACM 33 (8), August 1990 "Large" supersteps Bulk communication/routing between supersteps Syncronization to determine superstep completion Karp's LogP, ACM Symp. on Parallel Algorithms and Architectures, 1993 Processors can be: Operational: Computing, receiving, submitting a message Stalling: Delay in message being accepted by communication medium Parameters: L: Maximum time for message to arrive o: Overhead for preparing each message g: Time units between consecutive communication handling steps P: Maximum processor computation time PRAM algorithms are usually described in a SIMD fashion 2 Highly synchronized by constructs in programming notation Instructions are modified based on the processor id Algorithms are simplified by letting processors do useless work Lends to data parallel implementation - PROGRAMMER MUST REDUCE SYNCHRONIZATION OVERHEAD Example PRAM Models EREW (Exclusive Read, Exclusive Write) - Processors must access different memory cells. Most restrictive. CREW (Concurrent Read, Exclusive Write) - Either multiple reads or a single writer may access a cell ERCW (Exclusive Read, Concurrent Write) - Not popular CRCW (Concurrent Read, Concurrent Write) - Most flexible.
    [Show full text]
  • Towards a Spatial Model Checker on GPU⋆
    Towards a spatial model checker on GPU? Laura Bussi1, Vincenzo Ciancia2, and Fabio Gadducci1 1 Dipartimento di Informatica, Universit`adi Pisa 2 Istituto di Scienza e Tecnologie dell'Informazione, CNR Abstract. The tool VoxLogicA merges the state-of-the-art library of computational imaging algorithms ITK with the combination of declara- tive specification and optimised execution provided by spatial logic model checking. The analysis of an existing benchmark for segmentation of brain tumours via a simple logical specification reached very high accu- racy. We introduce a new, GPU-based version of VoxLogicA and present preliminary results on its implementation, scalability, and applications. Keywords: Spatial logics · Model Checking · GPU computation 1 Introduction and background Spatial and Spatio-temporal model checking have gained an increasing interest in recent years in various application domains, including collective adaptive [12, 11] and networked systems [5], runtime monitoring [17, 15, 4], modelling of cyber- physical systems [20] and medical imaging [13, 3]. Introduced in [7], VoxLogicA (Voxel-based Logical Analyser)3 caters for a declarative approach to (medical) image segmentation, supported by spatial model checking. A spatial logic is defined, tailored to high-level imaging features, such as regions, contact, texture, proximity, distance. Spatial operators are mostly derived from the Spatial Logic of Closure Spaces (SLCS, see Figure 1). Models of the spatial logic are (pixels of) images, with atomic propositions given by imaging features (e.g. colour, intensity), and spatial structure obtained via adjacency of pixels. SLCS features a modal operator near, denoting adjacency of pixels, and a reachability operator ρ φ1[φ2], holding at pixel x whenever there is a path from x to a pixel y satisfying φ1, with all intermediate points, except the extremes, satisfying φ2.
    [Show full text]
  • 2009-04-21 AMSC Cloud Assembler
    Towards a de novo short read assembler for large genomes using cloud computing Michael Schatz April 21, 2009 AMSC664 Advanced Scientific Computing Outline 1.! Genome assembly by analogy 2.! DNA sequencing and assembly 3.! MapReduce for genome assembly 4.! Research plan and related work Shredded Book Reconstruction •! Dickens accidently shreds the original A Tale of Two Cities –! Text printed on 5 long spools It was theIt was best the of besttimes, of times, it was it wasthe worstthe worst of of times, times, it it was was the the ageage of of wisdom, wisdom, it itwas was the agethe ofage foolishness, of foolishness, … … It was theIt was best the bestof times, of times, it was it was the the worst of times, it was the theage ageof wisdom, of wisdom, it was it thewas age the of foolishness,age of foolishness, … It was theIt was best the bestof times, of times, it was it wasthe the worst worst of times,of times, it it was the age of wisdom, it wasit was the the age age of offoolishness, foolishness, … … It was It thewas best the ofbest times, of times, it wasit was the the worst worst of times,of times, itit waswas thethe ageage ofof wisdom,wisdom, it wasit was the the age age of foolishness,of foolishness, … … It wasIt thewas best the bestof times, of times, it wasit was the the worst worst of of times, it was the age of ofwisdom, wisdom, it wasit was the the age ofage foolishness, of foolishness, … … •! How can he reconstruct the text? –! 5 copies x 138, 656 words / 5 words per fragment = 138k fragments –! The short fragments from every
    [Show full text]
  • Implementing a Tool for Designing Portable Parallel Programs
    Copyright Warning & Restrictions The copyright law of the United States (Title 17, United States Code) governs the making of photocopies or other reproductions of copyrighted material. Under certain conditions specified in the law, libraries and archives are authorized to furnish a photocopy or other reproduction. One of these specified conditions is that the photocopy or reproduction is not to be “used for any purpose other than private study, scholarship, or research.” If a, user makes a request for, or later uses, a photocopy or reproduction for purposes in excess of “fair use” that user may be liable for copyright infringement, This institution reserves the right to refuse to accept a copying order if, in its judgment, fulfillment of the order would involve violation of copyright law. Please Note: The author retains the copyright while the New Jersey Institute of Technology reserves the right to distribute this thesis or dissertation Printing note: If you do not wish to print this page, then select “Pages from: first page # to: last page #” on the print dialog screen The Van Houten library has removed some of the personal information and all signatures from the approval page and biographical sketches of theses and dissertations in order to protect the identity of NJIT graduates and faculty. ABSTRACT Implementing A Tool For Designing Portable Parallel Programs by Geetha Chitti The Implementation aspects of a novel parallel pro- gramming model called Cluster-M is presented in this the- sis. This model provides an environment for efficiently de- signing highly parallel portable software. The two main components of this model are Cluster-M Specifications and Cluster-M Representations.
    [Show full text]
  • Models for Parallel Computation in Multi-Core, Heterogeneous, and Ultra Wide-Word Architectures
    Models for Parallel Computation in Multi-Core, Heterogeneous, and Ultra Wide-Word Architectures by Alejandro Salinger A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Doctor of Philosophy in Computer Science Waterloo, Ontario, Canada, 2013 c Alejandro Salinger 2013 I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. iii Abstract Multi-core processors have become the dominant processor architecture with 2, 4, and 8 cores on a chip being widely available and an increasing number of cores predicted for the future. In ad- dition, the decreasing costs and increasing programmability of Graphic Processing Units (GPUs) have made these an accessible source of parallel processing power in general purpose computing. Among the many research challenges that this scenario has raised are the fundamental problems related to theoretical modeling of computation in these architectures. In this thesis we study several aspects of computation in modern parallel architectures, from modeling of computation in multi-cores and heterogeneous platforms, to multi-core cache management strategies, through the proposal of an architecture that exploits bit-parallelism on thousands of bits. Observing that in practice multi-cores have a small number of cores, we propose a model for low-degree parallelism for these architectures. We argue that assuming a small number of processors (logarithmic in a problem's input size) simplifies the design of parallel algorithms.
    [Show full text]
  • PRAM Algorithms Parallel Random Access Machine
    Parallel Random Access Machine (PRAM) n Collection of numbered processors n Accessing shared memory cells Control n Each processor could have local memory (registers) PRAM Algorithms n Each processor can access any shared memory cell in unit time Private P Memory 1 n Input stored in shared memory cells, output also needs to be Global stored in shared memory Private P Memory 2 Arvind Krishnamurthy n PRAM instructions execute in 3- Memory phase cycles Fall 2004 n Read (if any) from a shared memory cell n Local computation (if any) Private n Write (if any) to a shared memory P Memory p cell n Processors execute these 3-phase PRAM instructions synchronously Shared Memory Access Conflicts A Basic PRAM Algorithm n Different variations: n Let there be “n” processors and “2n” inputs n Exclusive Read Exclusive Write (EREW) PRAM: no two processors n PRAM model: EREW are allowed to read or write the same shared memory cell simultaneously n Construct a tournament where values are compared n Concurrent Read Exclusive Write (CREW): simultaneous read allowed, but only one processor can write P0 Processor k is active in step j v if (k % 2j) == 0 n Concurrent Read Concurrent Write (CRCW) At each step: n Concurrent writes: P0 P4 Compare two inputs, n Priority CRCW: processors assigned fixed distinct priorities, highest Take max of inputs, priority wins P0 P2 P4 P6 Write result into shared memory n Arbitrary CRCW: one randomly chosen write wins P0 P1 P2 P3 P4 P5 P6 P7 Details: n Common CRCW: all processors are allowed to complete write if and only if all
    [Show full text]
  • Introduction to Parallel Processing : Algorithms and Architectures
    Introduction to Parallel Processing Algorithms and Architectures PLENUM SERIES IN COMPUTER SCIENCE Series Editor: Rami G. Melhem University of Pittsburgh Pittsburgh, Pennsylvania FUNDAMENTALS OF X PROGRAMMING Graphical User Interfaces and Beyond Theo Pavlidis INTRODUCTION TO PARALLEL PROCESSING Algorithms and Architectures Behrooz Parhami Introduction to Parallel Processing Algorithms and Architectures Behrooz Parhami University of California at Santa Barbara Santa Barbara, California KLUWER ACADEMIC PUBLISHERS NEW YORK, BOSTON , DORDRECHT, LONDON , MOSCOW eBook ISBN 0-306-46964-2 Print ISBN 0-306-45970-1 ©2002 Kluwer Academic Publishers New York, Boston, Dordrecht, London, Moscow All rights reserved No part of this eBook may be reproduced or transmitted in any form or by any means, electronic, mechanical, recording, or otherwise, without written consent from the Publisher Created in the United States of America Visit Kluwer Online at: http://www.kluweronline.com and Kluwer's eBookstore at: http://www.ebooks.kluweronline.com To the four parallel joys in my life, for their love and support. This page intentionally left blank. Preface THE CONTEXT OF PARALLEL PROCESSING The field of digital computer architecture has grown explosively in the past two decades. Through a steady stream of experimental research, tool-building efforts, and theoretical studies, the design of an instruction-set architecture, once considered an art, has been transformed into one of the most quantitative branches of computer technology. At the same time, better understanding of various forms of concurrency, from standard pipelining to massive parallelism, and invention of architectural structures to support a reasonably efficient and user-friendly programming model for such systems, has allowed hardware performance to continue its exponential growth.
    [Show full text]