Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Solving Irregularly Structured Problems in Parallel

4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Gianfranco Bilardi
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Afonso Ferreira
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Reinhard Lüling
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. José Rolim
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1253)

Included in the following conference series:

Conference proceedings info: IRREGULAR 1997.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Keywords

Table of contents (23 papers)

  1. Front Matter

    Download chapter PDF

  2. Parallel mesh generation

    • Lutz Laemmer
    Pages 1-12

  3. Efficient massively parallel quicksort

    • Peter Sanders, Thomas Hansch
    Pages 13-24

  4. Practical parallel list ranking

    • Jop F. Sibeyn, Frank Guillaume, Tillmann Seidel
    Pages 25-36

  5. On computing all maximal cliques distributedly

    • Fábio Protti, Felipe M. G. França, Jayme Luiz Szwarcfiter
    Pages 37-48

  6. A probabilistic model for best-first search B&B algorithms

    • F. Argüello, N. Guil, J. López, M. Amor, E. L. Zapata
    Pages 49-60

  7. Programming irregular parallel applications in Cilk

    • Charles E. Leiserson
    Pages 61-71

  8. A variant of the biconjugate gradient method suitable for massively parallel computing

    • H. Martin Bücker, Manfred Sauren
    Pages 72-79

  9. Efficient implementation of the improved quasi-minimal residual method on massively distributed memory computers

    • Tianruo Yang, Hai-Xiang Lin
    Pages 80-92

  10. Programming with shared data abstractions

    • Simon Dobson, Don Goodeve
    Pages 93-102

  11. EXPLORER: Supporting run-time parallelization of DO-ACROSS loops on general networks of workstations

    • Yung-Lin Liu, Chung-Ta King
    Pages 103-110

  12. Engineering diffusive load balancing algorithms using experiments

    • Ralf Diekmann, S. Muthukrishnan, Madhu V. Nayakkankuppam
    Pages 111-122

  13. Comparative study of static scheduling with task duplication for distributed systems

    • Gyung-Leen Park, Behrooz Shirazi, Jeff Marquis
    Pages 123-134

  14. A new approximation algorithm for the register allocation problem

    • Klaus Jansen, Joachim Reiter
    Pages 135-146

  15. A parallel approximation algorithm for resource constrained scheduling and bin packing

    • Anand Srivastav, Peter Stangier
    Pages 147-158

  16. Virtual Data Space-A Universal load balancing scheme

    • Thomas Decker
    Pages 159-166

  17. Improving cache performance through tiling and data alignment

    • Preeti Ranjan Panda, Hiroshi Nakamura, Nikil D. Dutt, Alexandru Nicolau
    Pages 167-185

  18. A support for non-uniform parallel loops and its application to a flame simulation code

    • Salvatore Orlando, Raffaele Perego
    Pages 186-197

  19. Performance optimization of combined variable-cost computations and I/O

    • Sorin G. Nastea, Tarek El-Ghazawi, Ophir Frieder
    Pages 198-206

  20. Parallel shared-memory state-space exploration in stochastic modeling

    • Susann C. Allmaier, Graham Horton
    Pages 207-218
Back to top

Other volumes

  1. Solving Irregularly Structured Problems in Parallel

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation