Rating: 5.00
|
Workshop on Molecular Dynamics on Parallel Computers, John von Neumann Institute for Computing (NIC) Research Centre, Jülich, Germany, 8-10 February 1999
Designing efficient algorithms for these problems is a highly non-trivial task.This book contains the invited talks and abstracts presented at a conference by more than 100 researchers from various fields: computer science, solid state ...
by Rüdiger Esser, Peter Grassberger
 view
Buy
|
|
Introduction to parallel algorithms
SS (1987) Parallel Algorithms for Some Computational Problems in Advances in Computers, Academic Press, New York, pp. 93-153. Quinn, MJ (1987) Designing Efficient Algorithms for Parallel Computers, McGraw- Hill, New York. EXERCISES 3.1.
by C. Xavier, Sundararaja S. Iyengar
view
Buy
|
|
Vector and parallel processing - VECPAR 2000
Peterson, LL, Davie, BS: Computer Networks: A Systems Approach. Morgan Kaufmann Pbulishers, Inc., San Francisco (1996). 21. Quinn, MJ: Designing Efficient Algorithms for Parallel Computers. McGraw-Hill, New York (1987). 22.
by José M. L. M. Palma
view
Buy
| Rating: 1.00
|
Algorithms and Parallel Computing
Ad Hoc Techniques for Parallel Algorithms 7.1 INTRODUCTION This chapter discusses several ad hoc techniques used to implement parallel algorithms on parallel computers. Most of these techniques dealt with what is called embarrassingly ...
by Fayez Gebali
view
Buy
|
|
Parallel processing, CONPAR 94-VAPP VI : third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 6-8, 1994 : proceedings
Also: Technical Report 92-08, Dept. of Computing Science, University of Nijmegen , 1992. 15. MJ Quinn. Designing efficient algorithms for parallel computers. McGraw-Hill, New York, 1987. 16. DB Skillicorn.
by Jens Volkert
view
Buy
|
|
PARLE '92, parallel architectures and languages Europe, 4th International PARLE Conference, Paris, France, June 15-18, 1992, proceedings
New parallel-sorting schemes. IEEE Trans. Comput., C-27:669-673, 1978. [19] MJ QuiNN. Designing Efficient Algorithms for Parallel Computers. North-Holland, New York, 1987. [20] J. SALOWE AND W. STEIGER. Simplified stable merging tasks.
by Daniel Etiemble, Jean-Claude Syre
view
Buy
|
|
Network-based parallel computing, communication, architecture, and applications : second international workshop, CANPC '98, Las Vegas, Nevada, USA, January 31-February 1, 1998 : proceedings
In section 3, we detail a prototype design of our parallel programming system. In section 4, we illustrate how to incorporate efficient load balancing algorithms into our programming system, and in section 5 we show how to take ...
by Dhabaleswar K. Panda, Craig B. Stunkel
view
Buy
|
|
The Calgary Conference and Matrix Theory Papers
[M] BR Musicus, "Levinson and Fast Choleski Algorithms for Toeplitz and Almost Toeplitz Matrices," Internal Report, ... [Quinn] MJ Quinn, Designing Efficient Algorithms for Parallel Computers, McGraw-Hill, New York, 1987.
by Israel Gohberg, Seymour Goldberg, Marinus A. Kaashoeck, Peter Lancaster
view
Buy
|
|
Distributed and Parallel Computing, 6th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP, Melbourne, Australia, October 2-3, 2005 : Proceedings
1 Introduction The Voronoi diagram is one of the most popular geometrical structures in computational geometry [1], which is a branch of computer science concerned with designing efficient algorithms for solving geometrical problems.
by Michael Hobbs, Andrzej Gościński, Wanlei Zhou
view
Buy
|
|
Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing
Seymour is based on the emerging approach of designing parallel algorithms based on standardized global operations ... since designing efficient algorithms for parallel machines is vastly different from designing efficient algorithms ...
by SIAM Activity Group on Supercomputing
view
Buy
| |
|