this extended abstract introduces and evaluates a new model of parallel computation, called the parallel Asynchronous Recursion (PAR) model. this model offers distinct advantages to the program designer and the parall...
详细信息
Many methods exist for reconstructing three-dimensional surfaces given a collection of its contours. Surface reconstruction is used in medical research and diagnosis, geographical systems, and geometric design systems...
详细信息
In this paper, a new replica control algorithm, called the multiple tree quorum (MTQ) algorithm, is proposed to manage replicated data in distributed database systems. this algorithm provides a high availability for r...
详细信息
this paper proposes a scheme for changing the execution state of a pool of processes in a distributed environment where there may be processes in transit. the scheme can detect the completion of state change using wei...
详细信息
ISBN:
(纸本)0818626720
this paper proposes a scheme for changing the execution state of a pool of processes in a distributed environment where there may be processes in transit. the scheme can detect the completion of state change using weighted throw counting and detect the termination as well. It works whether the communication channels are synchronous or asynchronous, FIFO or non-FIFO. the message complexity of the scheme is typically O(number of processing elements).
A technique for structuring compute-aggregate-broadcast algorithms on distributed memory computers is presented. the compute-aggregate-broadcast paradigm provides an abstraction of the problem for the programmer, allo...
详细信息
ISBN:
(纸本)0818626720
A technique for structuring compute-aggregate-broadcast algorithms on distributed memory computers is presented. the compute-aggregate-broadcast paradigm provides an abstraction of the problem for the programmer, allowing for separation of computation and synchronization. Such algorithms are well suited for application on distributed memory computers. the structuring technique assists the parallel programmer with synchronization, allowing the programmer to concentrate more on developing code for computation. Two examples are presented.
We propose an efficient algorithm for termination detection of loosely synchronized computations. the proposed algorithm is fully symmetric in that all processes are syntactically identical and can detect global termi...
this paper presents a programming environment called C-NET we have developed for the reconfigurable SuperNode multiprocessor. It allows the implementation of variable-topology programs that are referred to as phase-re...
详细信息
this paper presents seven algorithms for multiprocessor scheduling of task trees. the objective function of the algorithms is to minimize parallel time (the time between the start of the first processor and completion...
详细信息
Many concurrent dictionary data structures have been proposed, but usually in the context of shared memory multiprocessors. In this paper, we present an algorithm for a concurrent distributed B-tree that can be implem...
详细信息
ISBN:
(纸本)0818626720
Many concurrent dictionary data structures have been proposed, but usually in the context of shared memory multiprocessors. In this paper, we present an algorithm for a concurrent distributed B-tree that can be implemented on message passing parallel computers. Our distributed B-tree (the dB-tree) replicates the interior nodes in order to improve parallelism and reduce message passing. We show how the dB-tree algorithm can be used to build an efficient, highly parallel, data-balanced distributed dictionary, the dE-tree.
distributed virtual memory (DVM) systems utilize the local memories and the disk spaces of interconnected nodes to support a global virtual address space for running processes. this paper discusses page replacement an...
详细信息
暂无评论