Artículos relacionados a Algorithm Engineering and Experimentation: International...
Algorithm Engineering and Experimentation: International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers (Lecture Notes in Computer Science) - Tapa blanda
Reseña del editor:
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.
Reseña del editor:
This book constitutes the thoroughly refereed post-workshop proceedings of the International Workshop on Algorithmic Engineering and Experimentation, ALENEX'99, held in Baltimore, Maryland, USA, in January 1999.
The 20 revised full papers presented were carefully selected from a total of 42 submissions during two rounds of reviewing and improvement. The papers are organized in sections on combinatorial algorithms, computational geometry, software and applications, algorithms for NP-hard problems, and data structures.
The 20 revised full papers presented were carefully selected from a total of 42 submissions during two rounds of reviewing and improvement. The papers are organized in sections on combinatorial algorithms, computational geometry, software and applications, algorithms for NP-hard problems, and data structures.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialSpringer
- Año de publicación2008
- ISBN 10 3540662278
- ISBN 13 9783540662273
- EncuadernaciónTapa blanda
- Número de páginas364
Comprar nuevo
Ver este artículo
EUR 58,07
Gastos de envío:
GRATIS
A Estados Unidos de America
Los mejores resultados en AbeBooks
Imagen del vendedor
Algorithm Engineering and Experimentation: International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers (Lecture Notes in Computer Science (1619)) [Soft Cover ]
Publicado por
Springer
(1999)
ISBN 10: 3540662278
ISBN 13: 9783540662273
Nuevo
Soft Cover
Cantidad disponible: 10
Librería:
Valoración
Descripción Soft Cover. Condición: new. Nº de ref. del artículo: 9783540662273
Comprar nuevo
EUR 58,07
Convertir moneda
Imagen de archivo
Algorithm Engineering and Experimentation: International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers (Lecture Notes in Computer Science, 1619)
Publicado por
Springer
(1999)
ISBN 10: 3540662278
ISBN 13: 9783540662273
Nuevo
Tapa blanda
Cantidad disponible: > 20
Librería:
Valoración
Descripción Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020174094
Comprar nuevo
EUR 57,00
Convertir moneda
Imagen de archivo
Algorithm Engineering and Experimentation : International Workshop ALENEX'99 Baltimore; MD; USA; January 15-16; 1999; Selected Papers
Publicado por
Springer
(1999)
ISBN 10: 3540662278
ISBN 13: 9783540662273
Nuevo
Tapa blanda
Cantidad disponible: > 20
Librería:
Valoración
Descripción Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Nº de ref. del artículo: ria9783540662273_lsuk
Comprar nuevo
EUR 60,61
Convertir moneda
Gastos de envío:
EUR 11,70
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen del vendedor
Algorithm Engineering and Experimentation : International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers
Publicado por
Springer Berlin Heidelberg
(1999)
ISBN 10: 3540662278
ISBN 13: 9783540662273
Nuevo
Taschenbuch
Cantidad disponible: 1
Librería:
Valoración
Descripción Taschenbuch. Condición: 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 ref. del artículo: 9783540662273
Comprar nuevo
EUR 59,51
Convertir moneda
Gastos de envío:
EUR 32,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen del vendedor
Algorithm Engineering and Experimentation
Publicado por
Springer Berlin Heidelberg
(1999)
ISBN 10: 3540662278
ISBN 13: 9783540662273
Nuevo
Kartoniert / Broschiert
Cantidad disponible: > 20
Librería:
Valoración
Descripción Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 ref. del artículo: 4897588
Comprar nuevo
EUR 48,37
Convertir moneda
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen de archivo
Algorithm Engineering and Experimentation : International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers
Publicado por
Springer 1999-06
(1999)
ISBN 10: 3540662278
ISBN 13: 9783540662273
Nuevo
PF
Cantidad disponible: 10
Librería:
Valoración
Descripción PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540662273
Comprar nuevo
EUR 80,36
Convertir moneda
Gastos de envío:
EUR 17,57
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen del vendedor
Algorithm Engineering and Experimentation
Publicado por
Springer Berlin Heidelberg Jun 1999
(1999)
ISBN 10: 3540662278
ISBN 13: 9783540662273
Nuevo
Taschenbuch
Cantidad disponible: 2
Librería:
Valoración
Descripción Taschenbuch. Condición: 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 ref. del artículo: 9783540662273
Comprar nuevo
EUR 80,24
Convertir moneda
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío