Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Versand:
EUR 12,00
Von Niederlande nach USA
Buchbeschreibung Zustand: as new. Cambridge, MA: The MIT Press, 1983. Hardcover. 155 pp.- This book solves several mathematical problems in the areas of Very Large Scale Integration (VLSI) and parallel computation. In particular, it describes optimal layouts for the shuffle-exchange graph, one of the best known networks for parallel computation. Attempts to design a shuffle-exchange computer have been hampered in part by the fact that, until now, no good layouts for the shuffle-exchange graph were known. The mesh of trees network (which may eventually prove as useful as the shuffle-exchange graph) is introduced and the book shows how it can be used to perform a variety of computations, including sorting and matrix multiplication, in a logarithmic number of steps. Next, the book introduces the tree of meshes, the first planar graph that was discovered not to have a linear-area layout. Most recently, the structure of this graph has been used to develop a general framework for solving VLSI graph layout problems. English text. Condition : as new. Condition : as new copy. ISBN 9780262121040. Keywords : , Artikel-Nr. 257056
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,550grams, ISBN:0262121042. Artikel-Nr. 8699051
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren