|
|
|
|
LEADER |
00000cam a2200000 a 4500 |
001 |
SCIDIR_ocn756424591 |
003 |
OCoLC |
005 |
20231120111848.0 |
006 |
m o d |
007 |
cr bn||||||abp |
007 |
cr bn||||||ada |
008 |
111008s1992 caua ob 001 0 eng d |
040 |
|
|
|a OCLCE
|b eng
|e pn
|c OCLCE
|d OCLCQ
|d OCLCF
|d OCLCO
|d OPELS
|d N$T
|d IDEBK
|d E7B
|d EBLCP
|d DEBSZ
|d YDXCP
|d OCLCQ
|d OCLCO
|d MERUC
|d INARC
|d OCLCQ
|d VT2
|d LUN
|d OCLCQ
|d OCLCO
|d S2H
|d OCLCO
|d OCL
|d OCLCQ
|d OCLCO
|
019 |
|
|
|a 755259240
|a 893979594
|a 909146565
|a 960894552
|a 1035753644
|a 1156351395
|a 1202537834
|
020 |
|
|
|a 9781483221151
|q (electronic bk.)
|
020 |
|
|
|a 1483221156
|q (electronic bk.)
|
020 |
|
|
|z 1558601171
|
020 |
|
|
|z 9781558601178
|
020 |
|
|
|z 9781483207728
|
020 |
|
|
|z 1483207722
|
035 |
|
|
|a (OCoLC)756424591
|z (OCoLC)755259240
|z (OCoLC)893979594
|z (OCoLC)909146565
|z (OCoLC)960894552
|z (OCoLC)1035753644
|z (OCoLC)1156351395
|z (OCoLC)1202537834
|
042 |
|
|
|a dlr
|
050 |
|
4 |
|a QA76.58
|b .L45 1992
|
072 |
|
7 |
|a COM
|x 013000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 014000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 018000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 067000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 032000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 037000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 052000
|2 bisacsh
|
082 |
0 |
4 |
|a 004/.35
|2 20
|
084 |
|
|
|a 54.51
|2 bcl
|
084 |
|
|
|a ST 130
|2 rvk
|
084 |
|
|
|a ST 151
|2 rvk
|
084 |
|
|
|a DAT 530f
|2 stub
|
084 |
|
|
|a DAT 216f
|2 stub
|
084 |
|
|
|a DAT 516f
|2 stub
|
100 |
1 |
|
|a Leighton, Frank Thomson.
|
245 |
1 |
0 |
|a Introduction to parallel algorithms and architectures :
|b arrays, trees, hypercubes /
|c F. Thomson Leighton.
|
260 |
|
|
|a San Mateo, Calif. :
|b M. Kaufmann Publishers,
|c �1992.
|
300 |
|
|
|a 1 online resource (xviii, 831 pages) :
|b illustrations
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
504 |
|
|
|a Includes bibliographical references (pages 785-801) and indexes.
|
505 |
0 |
|
|a Elementary sorting and counting -- Integer arithmetic -- Matrix algorithms -- Retiming and systolic conversion -- Graph algorithms -- Sorting revisited -- Packet routing -- Image analysis and computational geometry -- Higher-dimensional arrays -- The two-dimensional mesh of trees -- Elementary O(log N)-step algorithms -- Integer arithmetic -- Matrix algorithms -- Graph algorithms -- Fast evaluation of straight-line code -- Higher-dimensional meshes of trees -- The hypercube -- The butterfly, cube-connected-cycles, and Bene�s network -- The shuffle-exchange and de Bruijn graphs -- Packet-routing algorithms -- Sorting -- Simulating a parallel random access machine -- The fast Fourier transform -- Other hypercubic networks.
|
588 |
0 |
|
|a Print version record.
|
506 |
|
|
|3 Use copy
|f Restrictions unspecified
|2 star
|5 MiAaHDL
|
533 |
|
|
|a Electronic reproduction.
|b [Place of publication not identified] :
|c HathiTrust Digital Library,
|d 2011.
|5 MiAaHDL
|
538 |
|
|
|a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
|u http://purl.oclc.org/DLF/benchrepro0212
|5 MiAaHDL
|
583 |
1 |
|
|a digitized
|c 2011
|h HathiTrust Digital Library
|l committed to preserve
|2 pda
|5 MiAaHDL
|
520 |
|
|
|a Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes provides an introduction to the expanding field of parallel algorithms and architectures. This book focuses on parallel computation involving the most popular network architectures, namely, arrays, trees, hypercubes, and some closely related networks.Organized into three chapters, this book begins with an overview of the simplest architectures of arrays and trees. This text then presents the structures and relationships between the dominant network architectures, as well as the most efficient parallel algorithms for.
|
650 |
|
0 |
|a Parallel algorithms.
|
650 |
|
0 |
|a Parallel processing (Electronic computers)
|
650 |
|
0 |
|a Parallel programming (Computer science)
|
650 |
|
6 |
|a Parall�elisme (Informatique)
|0 (CaQQLa)201-0057785
|
650 |
|
6 |
|a Programmation parall�ele (Informatique)
|0 (CaQQLa)201-0062860
|
650 |
|
6 |
|a Algorithmes parall�eles.
|0 (CaQQLa)201-0315035
|
650 |
|
7 |
|a COMPUTERS
|x Computer Literacy.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Computer Science.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Data Processing.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Hardware
|x General.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Information Technology.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Machine Theory.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Reference.
|2 bisacsh
|
650 |
|
7 |
|a Parallel programming (Computer science)
|2 fast
|0 (OCoLC)fst01052939
|
650 |
|
7 |
|a Parallel algorithms
|2 fast
|0 (OCoLC)fst01052920
|
650 |
|
7 |
|a Parallel processing (Electronic computers)
|2 fast
|0 (OCoLC)fst01052928
|
650 |
|
7 |
|a Rechnerorganisation
|2 gnd
|0 (DE-588)4177175-8
|
650 |
|
7 |
|a Paralleler Algorithmus
|2 gnd
|0 (DE-588)4193615-2
|
650 |
|
7 |
|a Parallelrechner
|2 gnd
|0 (DE-588)4173280-7
|
650 |
1 |
7 |
|a Parallelprogrammering.
|2 gtt
|
650 |
1 |
7 |
|a Computerarchitectuur.
|2 gtt
|
776 |
0 |
8 |
|i Print version:
|w (DLC) 91033238
|w (OCoLC)24628348
|
856 |
4 |
0 |
|u https://sciencedirect.uam.elogim.com/science/book/9781483207728
|z Texto completo
|