Normal view MARC view

The Connection machine

Author: Hillis, W. Daniel Series: MIT Press series in artificial intelligence Publisher: MIT Press, 1985.Language: EnglishDescription: 190 p. : Ill. ; 24 cm.ISBN: 0262081571Type of document: BookNote: Includes index/Bibliography: p. [145]-172Thesis Note: Thesis (PhD)--MIT, 1985Bibliography/Index: Includes bibliographical references and index
Tags: No tags from this library for this title. Add tag(s)
Log in to add tags.
Item type Current location Collection Call number Status Date due
Book Doriot Library
Main Collection
Print QA267 .H487 1985
(Browse shelf)
000259808
Available

Includes index/Bibliography: p. [145]-172

Thesis (PhD)--MIT, 1985

Includes bibliographical references and index

Digitized

The Connection Machine Series Foreword Acknowledgments 1 Introduction 1.1 We Would Like to Make a Thinking Machine . . . . . . . . . 1.2 Classical Computer Architecture Reflects Obsolete Assumptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.3 Concurrency Offers a Solution . . . . . . . . . . . . . . . . . . X xi 1 1 3 5 10 18 22 25 28 29 31 31 37 41 1.4 Deducing the Requirements from an Algorithm . . . . . . . . 1.5 The Connection Machine Architecture . . . . . . . . . . . . . 1.6 Issues in Designing Parallel Machines . . . . . . . . . . . . . . . 1.7 Comparison with Other Architectures . . . . . . . . . . . . . 1.8 The Rest of the Story . . . . . . . . . . . . . . . . . . . . . . 1.9 Notes ............................... 2 How to Program a Connection Machine 2.1 Connection Machine Lisp Models the Connection Machine . . 2.2 Alpha Notation . . . . . . . . . . . . . . . . . . . . . . . . . . 2.3 Beta Reduction . . . . . . . . . . . . . . . . . . . . . . . . . . 2.4 Defining Data Structures with DEFSTRUCT (Background) . 2.5 An Example: The Path-Length Algorithm . . . . . . . . . . . 2.6 Generalized Beta . . . . . . . . . . . . . . . . . . . . . . . . . 2.7 CmLisp Defines the Connection Machine . . . . . . . . . . . . 2.8 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 44 46 47 48 49 3 Design Considerations 3.1 The Optimal Size of a Processor/Memory Cell . . . . . . . . 3.2 The Communications Network . . . . . . . . . . . . . . . . . 3.3 Choosing a Topology . . . . . . . . . . . . . . . . . . . . . . . 3.4 Tour of the Topology Zoo . . . . . . . . . . . . . . . . . . . . 3.5 Choosing a Routing Algorithm . . . . . . . . . . . . . . . . . 50 54 55 56 59 3.6 Local versus Shared Control . . . . . . . . . . . . . . . . . . . 3.7 3.8 3.9 3.10 3.11 3.12 3.13 61 63 64 65 65 66 67 69 .......................... Input/Output and Secondary Storage . . . . . . . . . . . . Synchronous versus Asynchronous Design . . . . . . . . . . Numeric versus Symbolic Processing . . . . . . . . . . . . . Scalability and Extendability . . . . . . . . . . . . . . . . . Evaluating Success . . . . . . . . . . . . . . . . . . . . . . . . Notes ............................... Fault Tolerance . . . . 4 The Prototype 71 72 74 78 83 88 89 91 4.1 The Chip 4.2 4.3 4.4 4.5 4.6 ............................. The Processor Cell . . . . . . . . . . . . . . . . . . . . . . . . The Topology . . . . . . . . . . . . . . . . . . . . . . . . . . . Routing Performance . . . . . . . . . . . . . . . . . . . . . . . . The Microcontroller . . . . . . . . . . . . . . . . . . . . . . . Sample Operation: Addition . . . . . . . . . . . . . . . . . . . 5 Data Structures for the Connection Machine 5.1 Active Data Structures . . . . . . . . . . . . . . . . . . . 5.2 Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ... 91 ... 92 5.3 Bit Representation of Sets . . . . . . . . . . . . . . . . . . . . . 92 5.4 Tag Representation of Sets . . . . . . . . . . . . . . . . . . . 93 5.5 Pointer Representation of Sets . . . . . . . . . . . . . . . . . 95 5.6 Shared Subsets . . . . . . . . . . . . . . . . . . . . . . . . . . 97 5.7 Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 5.8 Optimal Fanout of Tree . . . . . . . . . . . . . . . . . . . . . 101 5.9 Butterflies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106 5.10 Sorting On A Butterfly . . . . . . . . . . . . . . . . . . . . . 108 5.11 Induced Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . 109 5.12 Strings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 5.13 Arrays . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113 5.14 Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114 5.15 Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116 5.16 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119 6 Storage Allocation 6.1 Free List Allocation . . . . . . . . . . . . . . . . . . . . . . . 6.2 Random Allocation . . . . . . . . . . . . . . . . . . . . . . . . 6.3 Rendezvous Allocation . . . . . . . . . . . . . . . . . . . . . . 6.4 Waves . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.5 Block Allocation . . . . . . . . . . . . . . . . . . . . . . . . . 6.6 Garbage Collection . . . . . . . . . . . . . . . . . . . . . . . . 6.7 Compaction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.8 Swapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.9 Virtual Cells . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.10 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 121 123 124 126 128 129 131 133 135 135 7 New Computer Architectures and Their Relationship to Physics 137 or. Why Computer Science is No Good 7.1 Why Computer Science is No Good . . . . . . . . . . . . . . . 137 7.2 Connection Machine Physics . . . . . . . . . . . . . . . . . . . 139 7.3 New Hope for a Science of Computation . . . . . . . . . . . . 142 144 7.4 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Annotated Bibliography Index 145 173

There are no comments for this item.

Log in to your account to post a comment.
Koha 3.18 - INSEAD Library Catalogue
Library Home | Contact Us | What's Koha?