Articles liés à Algorithm Engineering and Experimentation: International...
Algorithm Engineering and Experimentation: International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers - Couverture souple
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer
- Date d'édition2008
- ISBN 10 3540662278
- ISBN 13 9783540662273
- ReliureBroché
- Langueanglais
- Nombre de pages364
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 53,49
EUR 10,99 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour Algorithm Engineering and Experimentation: International...
Image fournie par le vendeur
Algorithm Engineering and Experimentation. International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers
Edité par
Springer Berlin, 1999
ISBN 10 : 3540662278
ISBN 13 : 9783540662273
Ancien ou d'occasion
Softcover
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Softcover. 1999. 356 S. Ehem. Bibliotheksexemplar mit üblichen Merkmalen wie Signatur und Stempel. Moderate Lager- und Gebrauchsspuren. Text sauber. Guter Zustand. Sprache: englisch. Ex library book with stamps and signature. Slight signs of use. Good condition. Language: english. 9783540662273 Sprache: Englisch Gewicht in Gramm: 476. N° de réf. du vendeur 1106489
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Algorithm Engineering and Experimentation : International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers
Edité par
Springer Berlin Heidelberg, 1999
ISBN 10 : 3540662278
ISBN 13 : 9783540662273
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783540662273
Quantité disponible : 1 disponible(s)
Image d'archives
Algorithm Engineering and Experimentation: International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers (Lecture Notes in Computer Science, 1619)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540662273_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Algorithm Engineering and Experimentation: International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers: International . Papers (Lecture Notes in Computer Science)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783540662273
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Algorithm Engineering and Experimentation : International Workshop Alenex '99, Baltimore, Md, Usa, January 1999 : Selected Papers
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 918570-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Algorithm Engineering and Experimentation
Edité par
Springer Berlin Heidelberg, 1999
ISBN 10 : 3540662278
ISBN 13 : 9783540662273
Neuf
Kartoniert / Broschiert
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Kartoniert / Broschiert. Etat : New. 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 challe. N° de réf. du vendeur 4897588
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Algorithm Engineering and Experimentation : International Workshop Alenex '99, Baltimore, Md, Usa, January 1999 : Selected Papers
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 918570-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Algorithm Engineering and Experimentation : International Workshop Alenex '99, Baltimore, Md, Usa, January 1999 : Selected Papers
Edité par
Springer, 1999
ISBN 10 : 3540662278
ISBN 13 : 9783540662273
Ancien ou d'occasion
Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 918570
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Algorithm Engineering and Experimentation : International Workshop Alenex '99, Baltimore, Md, Usa, January 1999 : Selected Papers
Edité par
Springer, 1999
ISBN 10 : 3540662278
ISBN 13 : 9783540662273
Ancien ou d'occasion
Couverture souple
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 918570
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Algorithm Engineering and Experimentation
Edité par
Springer Berlin Heidelberg Jun 1999, 1999
ISBN 10 : 3540662278
ISBN 13 : 9783540662273
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 364 pp. Englisch. N° de réf. du vendeur 9783540662273
Quantité disponible : 2 disponible(s)