Lecture Notes in Computer Science

Algorithm Engineering and Experimentation

International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers

Editors: Goodrich, Michael T., McGeoch, Catherine C. (Eds.)

Free Preview

Buy this book

eBook $69.99
price for USA in USD
  • ISBN 978-3-540-48518-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $89.99
price for USA in USD
  • ISBN 978-3-540-66227-3
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Covid-19 shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
About this book

Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of e cient parallel algorithms for this platform c- rently poses several challenges. The reason for this is that the rapid progress in microprocessor speed has left main memory access as the primary limitation to SMP performance. Since memory is the bottleneck, simply increasing the n- ber of processors will not necessarily yield better performance. Indeed, memory bus limitations typically limit the size of SMPs to 16 processors. This has at least twoimplicationsfor the algorithmdesigner. First, since there are relatively few processors availableon an SMP, any parallel algorithm must be competitive with its sequential counterpart with as little as one processor in order to be r- evant. Second, for the parallel algorithm to scale with the number of processors, it must be designed with careful attention to minimizing the number and type of main memory accesses. In this paper, we present a computational model for designing e cient al- rithms for symmetric multiprocessors. We then use this model to create e cient solutions to two widely di erent types of problems - linked list pre x com- tations and generalized sorting. Both problems are memory intensive, but in die rent ways. Whereas generalized sorting algorithms typically require a large numberofmemoryaccesses, they areusuallytocontiguousmemorylocations. By contrast, prex computation algorithms typically require a more modest qu- tity of memory accesses, but they are are usually to non-contiguous memory locations.

Table of contents (20 chapters)

Table of contents (20 chapters)
  • Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes

    Pages 1-17

    Milidiú, Ruy Luiz (et al.)

  • Implementing Weighted

    Pages 18-36

    Müller-Hannemann, Matthias (et al.)

  • Designing Practical Efficient Algorithms for Symmetric Multiprocessors

    Pages 37-56

    Helman, David R. (et al.)

  • Circular Drawings of Biconnected Graphs

    Pages 57-73

    Six, Janet M. (et al.)

  • Heuristics and Experimental Design for Bigraph Crossing Number Minimization

    Pages 74-93

    Stallmann, Matthias (et al.)

Buy this book

eBook $69.99
price for USA in USD
  • ISBN 978-3-540-48518-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $89.99
price for USA in USD
  • ISBN 978-3-540-66227-3
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Covid-19 shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
Loading...

Bibliographic Information

Bibliographic Information
Book Title
Algorithm Engineering and Experimentation
Book Subtitle
International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers
Editors
  • Michael T. Goodrich
  • Catherine C. McGeoch
Series Title
Lecture Notes in Computer Science
Series Volume
1619
Copyright
1999
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-48518-6
DOI
10.1007/3-540-48518-X
Softcover ISBN
978-3-540-66227-3
Series ISSN
0302-9743
Edition Number
1
Number of Pages
VIII, 356
Topics