Mendeley出力
＜図書＞
Concurrent Aggregates : supporting modularity in massively parallel programs
| 責任表示 | Andrew A. Chien |
|---|---|
| データ種別 | 図書 |
| 出版情報 | Cambridge, Mass. : MIT Press , c1993 |
| 本文言語 | 英語 |
| 大きさ | xvii, 194 p. : ill. ; 24 cm |
| 概要 | Concurrent Aggregates addresses a key problem in programming languages for massively parallel machines: how to write programs that are both modular and highly concurrent. It describes a novel approach...for managing program complexity, based on multi-access data abstractions and combining ideas from object-oriented and data-parallel approaches, that allows programmers to build modular programs without sacrificing concurrency. The concepts are developed and, using application kernels, evaluated for effectiveness and implementability. The programming language called Concurrent Aggregates incorporates innovative data abstraction tools that allow unlimited concurrency. Concurrent Aggregates surpasses existing data-parallel languages in its support for arbitrary concurrent abstractions, not simply arrays or sets, as well as its support for heterogeneous concurrency. By adapting a proven complexity management and code reuse technique, data abstraction, to massively parallel systems, Chien produces a language suited for high degrees of concurrency and modular programs. The data abstraction tools, aggregates, permit exploitation of both homogeneous data and heterogeneous concurrency (operations against a parallel abstraction) in uniform and efficient style. Aggregates can encapsulate arbitrary amounts of data and concurrency, thus limiting the complexity of Concurrent Aggregates programs. Concurrent Aggregates even supports efficient composition of concurrent data abstractions. Concurrent Aggregates is designed for machines of the future. Chien presents a vision of how to organize computations on massively parallel MIMD machines and program them in modular fashion while facilitating efficient execution by allowing tuning within each abstraction. His unique perspective as a designer of the processor, network, and operating systems for the J-Machine prototype results in a language design that reflects the costs of computation in future systems. Andrew Andai Chien is Assistant Professor in the Department of Computer Science at the University of Illinois at Champaign-Urbana. 続きを見る |
所蔵情報
| 状態 | 巻次 | 所蔵場所 | 請求記号 | 刷年 | 文庫名称 | 資料番号 | コメント | 予約・取寄 | 複写申込 | 自動書庫 |
|---|---|---|---|---|---|---|---|---|---|---|
|
|
|
理系図 自動書庫 | 1993 |
|
027232004154513 |
|
||||
|
|
|
理系図 自動書庫 | 007.64/C 42 | 1993 |
|
068252194000763 |
|
|||
|
|
|
筑紫図 1B 000-399 | 007.64/C 42 | 1993 |
|
160032021000147 |
|
書誌詳細
| 一般注記 | Includes bibliographical references (p. [183]-190) and index |
|---|---|
| 著者標目 | *Chien, Andrew Andai |
| 件 名 | LCSH:Concurrent Aggregates (Computer program language) LCSH:Parallel programming (Computer science) |
| 分 類 | LCC:QA76.73.C652 DC20:005.13/3 |
| 書誌ID | 1001141705 |
| ISBN | 0262032066 |
| NCID | BA19898849 |
| 巻冊次 | ISBN:0262032066 |
| 登録日 | 2009.09.17 |
| 更新日 | 2021.07.07 |