Kiloprocessor Extensions to SCI

نویسنده

  • Stefanos Kaxiras
چکیده

† This work was supported in part by NSF Grants CCR-9207971 and CCR-9509589, funding from the Apple Computer Advanced Technology Group, and donations from Thinking Machines Corporation. Our T.M.C. CM-5 was purchased through NSF Grant CDA-9024618, with matching funding from the University of Wisconsin Graduate School. ‡ Editor, IEEE P1596.2 proposed Standard. The views expressed in this paper are the author’s and do not imply endorsement from IEEE. Abstract

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending the Scalable Coherent Interface for Large-scale Shared-memory Multiprocessors

Massively parallel machines promise to provide enormous computing power using an amalgamation of low-cost parts. We believe many of these will be shared-memory machines, since they do not burden the programmer with data placement and nonuniform access semantics. However, an efficient kiloprocessor solution for the shared-memory paradigm has proven elusive due to bottlenecks associated with para...

متن کامل

Rough sets: Some extensions

In this article, we present some extensions of the rough set approach and we outline a challenge for the rough set based research. 2006 Elsevier Inc. All rights reserved.

متن کامل

Approximating the Number of Linear Extensions

We approximate the number of linear extensions of an ordered set by counting “critical” suborders.

متن کامل

The standard completeness of interval-valued monoidal t-norm based logic

In this paper we prove the strong standard completeness of interval-valued monoidal t-norm based logic (IVMTL) and some of its extensions. For other extensions we show that they are not strong standard complete. We also give a local deduction theorem for IVMTL and other extensions of interval-valued monoidal logic. Similar results are obtained for interval-valued fuzzy logics expanded with Baaz...

متن کامل

Probabilistic Thread Algebra

We add probabilistic features to basic thread algebra and its extensions with thread-service interaction and strategic interleaving. Here, threads represent the behaviours produced by instruction sequences under execution and services represent the behaviours exhibited by the components of execution environments of instruction sequences. In a paper concerned with probabilistic instruction seque...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996