Solving Irregularly Structured Problems in Parallel: 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, ProceedingsGianfranco Bilardi Springer Science & Business Media, 1997. gada 4. jūn. - 286 lappuses This book constitutes the refereed proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, IRREGULAR'97, held in Paderborn, Germany, in June 1997. The 18 revised full papers presented were carefully selected by the program committee for inclusion in the volume; also included are full papers by the five invited speakers. Among the topics covered are discrete algorithms, randomized methods and approximation algorithms, implementations, programming environments, systems and applications, and scheduling and load balancing. |
Saturs
Parallel Mesh Generation | 1 |
Efficient Massively Parallel Quicksort | 13 |
Practical Parallel List Ranking | 25 |
On Computing All Maximal Cliques Distributedly | 37 |
A Probabilistic Model for BestFirst Search BB Algorithms | 49 |
Programming Irregular Parallel Applications in Cilk | 61 |
A Variant of the Biconjugate Gradient Method Suitable for Massively Parallel Computing | 72 |
Efficient Implementation of the Improved QuasiMinimal Residual Method on Massively Distributed Memory Computers | 80 |
A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing | 147 |
Virtual Data Space A Universal Load Balancing Scheme | 159 |
Improving Cache Performance through Tiling and Data Alignment | 167 |
A Support for Nonuniform Parallel Loops and Its Application to a Flame Simulation Code | 186 |
Performance Optimization of Combined VariableCost Computations and IO | 198 |
Parallel SharedMemory StateSpace Exploration in Stochastic Modeling | 207 |
Parallel Software Caches | 219 |
Communication Efficient Parallel Searching | 233 |
Programming with Shared Data Abstractions | 93 |
Supporting RunTime Parallelization of DOACROSS Loops on General Networks of Workstations | 103 |
Engineering Diffusive Load Balancing Algorithms Using Experiments | 111 |
Comparative Study of Static Scheduling with Task Duplication for Distributed Systems | 123 |
A New Approximation Algorithm for the Register Allocation Problem | 135 |
Parallel Sparse Cholesky Factorization | 255 |
Unstructured Graph Partitioning for Sparse Linear System Solving | 273 |
Author Index | |
Citi izdevumi - Skatīt visu
Solving Irregularly Structured Problems in Parallel: 4th International ... Gianfranco Bilardi,Afonso Ferreira,Reinhard Lüling,Jose Rolim Priekšskatījums nav pieejams - 2014 |
Bieži izmantoti vārdi un frāzes
allocation applications array B-tree biconjugate gradient method block bound cache miss Cilk colors communication congestion data structure distributed memory dynamic edges efficient elements entry example execution Figure flow graph function global graph G graph partitioning hash heuristic IEEE implementation improved input iteration Lanczos Lanczos algorithm Lemma linear load balancing loop machine mapping maximal cliques memory computers mesh method multiplication multiprocessor multisearch algorithm nested dissection node number of nodes number of processors obtained operations optimal overhead packets parallel algorithms Parallel Computing parameters partitioning path performance pointer jumping problem Proc procedure Proceedings queries queue quicksort random recursion resource constrained scheduling rows runtime SADT scalability scheme Section selection sequential simulation software cache solution sparse matrix speedup stack static step strategy subdomain supernode SUPPLE task technique thread tile update variables vector workload
Populāri fragmenti
271. lappuse - V. Kumar, A. Grama, A. Gupta, G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin Cummings, Menlo Park, CA, 1993.