Scalable concurrent computing

نویسندگان
چکیده

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

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

منابع مشابه

Scalable Computing

Scalable computing will, over the next few years, become the normal form of computing. In this paper we present a uniied framework , based on the BSP model, which aims to serve as a foundation for this evolutionary development. A number of important techniques, tools and methodologies for the design of sequential algorithms and programs have been developed over the past few decades. In the tran...

متن کامل

Resizable, Scalable, Concurrent Hash Tables

We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups. These resize algorithms allow the hash table to maintain constant-time performance as the number of entries grows, and reclaim memory as the number of entries decreases, without delaying or disrupting readers. We implemented our algorithms in the Linux kernel, to test ...

متن کامل

Highly-Scalable Reconfigurable Computing

Reconfigurable computing, typically deployed using Field-Programmable Gate Arrays (FPGAs), is a technology that is ideally suited to exploit the fine-grained parallelism that exists in many algorithms and applications. SGI is a manufacturer of large-scale, high-performance computer systems and has recently developed an FPGA-based node that is integrated into its interconnect architecture. Exegy...

متن کامل

Complexity in scalable computing

The rich history of scalable computing research owes much to a rapid rise in computing platform scale in terms of size and speed. As platforms evolve, so must algorithms and the software expressions of those algorithms. Unbridled growth in scale inevitably leads to complexity. This special issue grapples with two facets of this complexity: scalable execution and scalable development. The former...

متن کامل

Enhancing KiWi - Scalable Concurrent Key-Value Map

We​ ​take​ ​a​ ​relatively​ ​fresh​ ​wait-free,​ ​concurrent​ ​sorted​ ​map​ ​called​ ​KiWi,​ ​fix​ ​and​ ​enhance​ ​it. First,​ ​we​ ​test​ ​its​ ​linearizability​ ​by​ ​fuzzing​ ​and​ ​applying​ ​Wing&Gong​ ​[2]​ ​linearizability​ ​test. After​ ​fixing​ ​a​ ​few​ ​bugs​ ​in​ ​the​ ​algorithm​ ​design​ ​and​ ​its​ ​implementation,​ ​we​ ​enhance​ ​it.​ ​We design,​ ​implement​ ​and​ ​test​ ​tw...

متن کامل

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


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

ژورنال

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

سال: 1992

ISSN: 0256-2499,0973-7677

DOI: 10.1007/bf02811343