Tipo de artículo
Condición
Encuadernación
Más atributos
Ubicación del vendedor
Valoración de los vendedores
Publicado por Springer Berlin, 1999
ISBN 10: 3540662278ISBN 13: 9783540662273
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
Libro
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.
Publicado por Springer, 1999
ISBN 10: 3540662278ISBN 13: 9783540662273
Librería: booksXpress, Bayonne, NJ, Estados Unidos de America
Libro
Soft Cover. Condición: new.
Publicado por Springer, 1999
ISBN 10: 3540662278ISBN 13: 9783540662273
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Libro
Condición: New.
Publicado por Springer, 1999
ISBN 10: 3540662278ISBN 13: 9783540662273
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Libro Impresión bajo demanda
Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Publicado por Springer Berlin Heidelberg, 1999
ISBN 10: 3540662278ISBN 13: 9783540662273
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Libro
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.
Publicado por Springer Berlin Heidelberg, 1999
ISBN 10: 3540662278ISBN 13: 9783540662273
Librería: moluna, Greven, Alemania
Libro Impresión bajo demanda
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.
Publicado por Springer 1999-06, 1999
ISBN 10: 3540662278ISBN 13: 9783540662273
Librería: Chiron Media, Wallingford, Reino Unido
Libro
PF. Condición: New.
Publicado por Springer Berlin Heidelberg Jun 1999, 1999
ISBN 10: 3540662278ISBN 13: 9783540662273
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Libro Impresión bajo demanda
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.