Algorithms for Parallel ProcessingMichael T. Heath, Abhiram Ranade, Robert S. Schreiber Springer Science & Business Media, 1998. gada 14. dec. - 373 lappuses This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING. " The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. We thank Michael T. Heath of University of lllinois at Urbana (Com puter Science), Abhiram Ranade of the Indian Institute of Technology (Computer Science and Engineering), and Robert S. Schreiber of Hewlett Packard Laboratories for their excellent work in organizing the workshop and editing the proceedings. We also take this opportunity to thank the National Science Founda tion (NSF) and the Army Research Office (ARO), whose financial support made the workshop possible. A vner Friedman Robert Gulliver v PREFACE The Workshop on Algorithms for Parallel Processing was held at the IMA September 16 - 20, 1996; it was the first workshop of the IMA year dedicated to the mathematics of high performance computing. The work shop organizers were Abhiram Ranade of The Indian Institute of Tech nology, Bombay, Michael Heath of the University of Illinois, and Robert Schreiber of Hewlett Packard Laboratories. Our idea was to bring together researchers who do innovative, exciting, parallel algorithms research on a wide range of topics, and by sharing insights, problems, tools, and methods to learn something of value from one another. |
No grāmatas satura
1.–5. rezultāts no 11.
151. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
152. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
153. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
154. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
155. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
A GENERALPURPOSE SHAREDMEMORY MODEL FOR PARALLEL COMPUTATION | 1 |
AN APPLICATIONDRIVEN INVESTIGATION | 19 |
SINGLEMESSAGE VS BATCH COMMUNICATION | 61 |
SOME SIMPLE AND PRACTICAL STRATEGIES FOR PARALLELISM | 75 |
ROUTING IN OPTICAL AND WIRELESS NETWORKS | 101 |
TRANSPARENT PARALLEL TRANSACTIONS ON REPLICATED AUTONOMOUS DATABASES | 117 |
FROM SYSTEMS OF UNIFORM RECURRENCE EQUATIONS TO THE POLYTOPE MODEL | 147 |
THE SCALABILITY OF MESH IMPROVEMENT ALGORITHMS | 185 |
DATA PARALLEL PERFORMANCE OPTIMIZATIONS USING ARRAY ALIASING | 213 |
ELEMENTS OF THE MULTILEVEL METHOD | 247 |
SOME METHODS OF PARALLEL PSEUDORANDOM NUMBER GENERATION | 277 |
PERFORMANCE OF PARALLEL SPARSE TRIANGULAR SOLUTION | 289 |
DETERMINING AN OUTOFCORE FFT DECOMPOSITION STRATEGY FOR PARALLEL DISKS BY DYNAMIC PROGRAMMING | 307 |
ENABLING DEPARTMENTSCALE SUPERCOMPUTING | 321 |
PROVIDING UNIFORM DYNAMIC ACCESS TO NUMERICAL SOFTWARE | 345 |
Citi izdevumi - Skatīt visu
Algorithms for Parallel Processing Michael T. Heath,Abhiram Ranade,Robert S. Schreiber Ierobežota priekšskatīšana - 2012 |
Algorithms for Parallel Processing Michael T. Heath,Abhiram Ranade,Robert S. Schreiber Priekšskatījums nav pieejams - 2012 |
Algorithms for Parallel Processing Michael T Heath,Abhiram Ranade,Robert S Schreiber Priekšskatījums nav pieejams - 1998 |
Bieži izmantoti vārdi un frāzes
address space applications Architectures ASCI Red assignment bandwidth batch bound called coarsening communication Computer Science connected components cost data structures database defined disk distributed edges efficient elemental operation equations example execution factor fetches Fiedler vector Figure flipping Fortran function gap parameter global graph G grid hierarchy implementation improvement input integer Intel Paragon interface iteration linear linear programming lock loop machines Mathematics mesh multilevel method multiprocessors N-body NetSolve number of processors numerical library object optimal out-of-core Parallel Algorithms parallel computation partition performance PRAM problem programming protocol pseudorandom QSM(g random number recursive refinement replication routing schedule Section sequence shared shared-memory simulation single-message smoothing SMP nodes solution sparse matrix SPMD step strongly connected component subdomains subnetwork synchronization systolic array techniques THEOREM tion transformations uniprocessor update transactions vector vertex vertices work-preserving write zero weight