Filters








11 Hits in 7.7 sec

Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design

Vijaya Ramachandran, Brian Grayson, Michael Dahlin
2003 Journal of Parallel and Distributed Computing  
The simplicity of the QSM parameters makes QSM a convenient model for parallel algorithm design, and simple work-preserving emulations of QSM on BSP and QSM on LogP show that algorithms designed for the  ...  In conjunction with earlier work-preserving emulations between QSM and BSP, these results establish a close correspondence between these three general-purpose parallel models.  ...  Basic QSM Algorithms To support using QSM or s-QSM for designing general-purpose parallel algorithms, we develop a suitable cost metric for such algorithms.  ... 
doi:10.1016/j.jpdc.2003.04.001 fatcat:klples6dvfdflhxqlt3gfv7csy

Parallel Algorithm Design with Coarse-Grained Synchronization [chapter]

Vijaya Ramachandran
2001 Lecture Notes in Computer Science  
We describe the Queuing Shared-Memory (QSM) and Bulk-Synchronous Parallel (BSP) models of parallel computation. The former is shared-memory and the latter is distributed-memory.  ...  We describe the relationship of these two models to each other and to the 'LogP' model, and give an overview of algorithmic results on these models.  ...  Introduction An important goal in parallel processing is the development of general-purpose parallel models and algorithms. However, this task has not been an easy one.  ... 
doi:10.1007/3-540-45718-6_67 fatcat:2uzbyas4z5ajjku5wt67s5d2lu

A General-Purpose Shared-Memory Model for Parallel Computation [chapter]

Vijaya Ramachandran
1999 IMA Volumes in Mathematics and its Applications  
We describe a general-purpose shared-memory model for parallel computation, called the qsm 22 , which provides a high-level shared-memory abstraction for parallel algorithm design, as well as the ability  ...  t o b e e m ulated in an e ective manner on the bsp, a l o wer-level, distributedmemory model.  ...  Acknowledgement I w ould like to thank Phil Gibbons and Yossi Matias for innumerable discussions on queuing shared memory models; this collaboration led to the results in 19, 20, 21, 22 .  ... 
doi:10.1007/978-1-4612-1516-5_1 fatcat:lgk7xvduxnh47ecwopombqe6ui

Can shared-memory model serve as a bridging model for parallel computation?

Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1997 Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97  
The BSP and LogP models imply a rather different style for designing algorithms when compared with the PRAM model.  ...  There has been a great deal of interest recently in the development of general-purpose bridging models for parallel computation.  ...  Finally, we present algorithmic results for the QSM, as well as general strategies for mapping algorithms designed for the BSP or PRAM models onto the QSM model.  ... 
doi:10.1145/258492.258500 dblp:conf/spaa/GibbonsMR97 fatcat:gkvh5eocujhdtcqlrjqouyudt4

Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?

P. B. Gibbons, Y. Matias
1999 Theory of Computing Systems  
The BSP and LogP models imply a rather different style for designing algorithms when compared with the PRAM model.  ...  There has been a great deal of interest recently in the development of general-purpose bridging models for parallel computation.  ...  Finally, we present algorithmic results for the QSM, as well as general strategies for mapping algorithms designed for the BSP or PRAM models onto the QSM model.  ... 
doi:10.1007/s002240000121 fatcat:6q5ler4h5nb2jjlzxdsz25hylm

Hierarchical Models and Software Tools for Parallel Programming [chapter]

Massimo Coppola, Martin Schmollinger
2003 Lecture Notes in Computer Science  
We thus need well-founded models and efficient new tools for hierarchical parallel machines, in order to connect algorithm design and complexity results to high-performance program implementation.  ...  While memory hierarchies have been recognized for a long-time, only in the last years hierarchical parallel structures have gained importance, mainly as a result of the trend towards cluster architectures  ...  Acknowledgments We wish to thank all the participants to the GI-Dagstuhl-Forschungsseminar "Algorithms for Memory Hierarchies".  ... 
doi:10.1007/3-540-36574-5_15 fatcat:mgkm5xi34vanfjx2fkryqfoq4i

Modeling Parallel Bandwidth: Local versus Global Restrictions

M. Adler, P. B. Gibbons, Y. Matias, V. Ramachandran
1999 Algorithmica  
., BSP, LOGP, and QSM) account for bandwidth limitations using a per-processor parameter g > 1, such that each processor can send/receive at most h messages in g · h time.  ...  We present a new parallel scheduling algorithm for globally limited models that enable an unknown, arbitrarily unbalanced set of messages to be sent through the limited bandwidth within a (1 + ε) factor  ...  We thank Torsten Suel for helpful comments.  ... 
doi:10.1007/pl00008269 fatcat:w56pdjmqqfe3hh5ldpbvzgbiu4

Modeling parallel bandwidth

Micah Adler, Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias
1997 Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97  
., bsp, logp, a n d qsm) account for bandwidth limitations using a per-processor parameter g > 1, such that each processor can send/receive at most h messages in g h time.  ...  For concreteness, we consider the following four models: The bsp model 45], a message-passing model with a per-processor bandwidth parameter g, denoted in this paper as the bsp(g) model.  ...  Acknowledgements We thank Torsten Suel for helpful comments.  ... 
doi:10.1145/258492.258502 dblp:conf/spaa/AdlerGRM97 fatcat:lmgw3ifghvbuzhwamcds2s6are

Portable and efficient parallel computing using the BSP model

M.W. Goudreau, K. Lang, S.B. Rao, T. Suel, T. Tsantilas
1999 IEEE transactions on computers  
The Bulk-Synchronous Parallel (BSP) model was proposed by Valiant as a standard interface between parallel software and hardware.  ...  We describe the design and implementation of the Green BSP Library, a small library of functions that implement the BSP model, and of several applications that were written for this library.  ...  We acknowledge helpful discussions with Kai Li and Jim Philbin on the BSP library, and with J. P. Singh on N-body simulations.  ... 
doi:10.1109/12.780876 fatcat:k6xsoc775zfsxoznrrgepv2aru

Computational bounds for fundamental problems on general-purpose parallel models

Philip D. MacKenzie, Vijaya Ramachandran
1998 Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures - SPAA '98  
We present lower bounds for time needed to solve basic problems on three general-purpose models of parallel computation: the shared-memory models qsm and s-qsm, and the distributed-memory model, the bsp  ...  Our results on'rounds' is of special interest in the context of designing work-e cient algorithms on a machine where latency and synchronization costs are high.  ...  The bsp 24 and logp 5 models are distributed memory models of this type, and the qsm 10 and s-qsm are shared-memory models of this type.  ... 
doi:10.1145/277651.277681 dblp:conf/spaa/MackenzieR98 fatcat:zf2bjy3dajexnbymse7234i6c4

Chapter 5. Realistic Computer Models [chapter]

Deepak Ajwani, Henning Meyerhenke
2010 Lecture Notes in Computer Science  
A similar argument applies to QSM, because it can also be emulated efficiently on a BSP machine (and vice versa) [332, 661] .  ...  Consequently, apart from a number of basic algorithms for LogP, there seems to be little interest in further results on design and analysis of LogP algorithms (compare [661] and [187] ).  ... 
doi:10.1007/978-3-642-14866-8_5 fatcat:j326q2ymeffzfmo36nqst7msmq