Цель данного обзора дать максимально полное представление о достижениях и
современном состоянии дел в разработке аналитических моделей параллельных …

The ability of parallel computing to process large data sets and handle time-consuming
operations has resulted in unprecedented advances in biological and scientific computing …

This paper surveys and places into perspective a number of results concerning the D-BSP
(Decomposable Bulk Synchronous Parallel) model of computation, a variant of the popular …

Появление мощных многопроцессорных вычислительных систем выдвигает на первый
план вопросы, связанные с разработкой фреймворков (шаблонов), позволяющих …

The design of algorithms that can run unchanged yet efficiently on a variety of machines
characterized by different degrees of parallelism and communication capabilities is a highly …

Summary form only given. The design of algorithms exhibiting a high degree of temporal
and spatial locality of reference is crucial to attain good performance on current and …

We present a general deterministic scheme to implement a shared memory abstraction on
any distributed-memory machine which exhibits a clustered structure. More specifically, we …

One important objective of models of computation [1] is to provide a framework for the design
and the analysis of algorithms that can be executed efficiently on physical machines. In view …

A framework is proposed for the design and analysis of network-oblivious algorithms,
namely algorithms that can run unchanged, yet efficiently, on a variety of machines …

We prove an analogue of Brent's lemma for BSP-like parallel machines featuring a
hierarchical structure for both the interconnection and the memory. Specifically, for these …