A termination detector is a distributed algorithm that, when superimposed on a distributed system of n processes, is able to determine whether the underlying computation has terminated. Fault tolerance has always been...
详细信息
the feasibility of reconstructing a single photon emission computed tomography (SPECT) image via the parallel implementation of a backpropagation neural network is shown. the MasPar MP-1 is a single-instruction multip...
详细信息
Replication is a common method for increasing the availability of data in a distributed environment. Our interest is in the application of replication techniques in the domain of parallelprocessing. this paper explor...
详细信息
ISBN:
(纸本)0818626720
Replication is a common method for increasing the availability of data in a distributed environment. Our interest is in the application of replication techniques in the domain of parallelprocessing. this paper explores the issues concerning degree of replication and granularity in the context of a distributed and highly available Linda tuple space. In particular, we study the performance effects of varying the number of replicas and the granularities of replication and concurrency control. Traditionally, when using replication in databases, the granularity of replication and that of concurrency control have been the same (at the file level, for example). this is not an inherent requirement however. In this paper we show by detailed simulation of a replicated Linda tuple space that it is useful to separate the two granularities and that it is an important design issue especially in parallelprocessing systems.
this paper presents parallel implementations of connected component labeling for grey level images on the iPSC/2 & iPSC/860 hypercubes and on the Encore Multimax shared memory multiprocessor. Several partitioning ...
详细信息
ISBN:
(纸本)0818626720
this paper presents parallel implementations of connected component labeling for grey level images on the iPSC/2 & iPSC/860 hypercubes and on the Encore Multimax shared memory multiprocessor. Several partitioning and mapping strategies including multidimensional divide and conquer, block decomposition and scatter decomposition are used. Implementation results, performance evaluation and comparison for all the mapping strategies are reported.
Nonreplicated shared data of distributed applications is optimally allocated to pre-specified multilevel memory partitions at the sites of a heterogeneous multicomputer network to minimize a weighted combination of sy...
详细信息
ISBN:
(纸本)0818626720
Nonreplicated shared data of distributed applications is optimally allocated to pre-specified multilevel memory partitions at the sites of a heterogeneous multicomputer network to minimize a weighted combination of systemwide mean time delay performance and mean communication cost per access request. Greedy and fast optimization algorithms are presented for nonqueueing lightly-loaded as well as heavily-loaded multiqueue system models with channel, I/O, and memory hierarchy queues. Extensions to data exhibiting nonuniform access demand rates and distinct query and update statistics are presented.
We present a new load balancing strategy and its application to distributed branch & bound algorithms and demonstrate its efficiency by solving some NP-complete problems on a network of up to 256 Transputers. the ...
详细信息
ISBN:
(纸本)0818626720
We present a new load balancing strategy and its application to distributed branch & bound algorithms and demonstrate its efficiency by solving some NP-complete problems on a network of up to 256 Transputers. the parallelization of our branch & bound algorithm is fully distributed. Every processor performs the same algorithm but each on a different part of the solution tree. In this case it is necessary to distribute subproblems among the processors to achieve a well balanced workload. Our load balancing method overcomes the problem of search overhead and idle times by an appropriate load model and avoids trashing effects by a feedback control method. Using this strategy we were able to achieve a speedup of up to 237.32 on a 256 processor network for very short parallel computation times, compared to an efficient sequential algorithm.
this paper studies the ability of the hypercube to implement algorithms with ring, mesh, and torus communication patterns when the hypercube contains faults. Our primary result is a fault-free embedding of the longest...
详细信息
We study the bit-complexity (i.e. total number of bits transmitted) of computing boolean functions on anonymous Cayley networks. We show that if G is a set of generators for a group G then a boolean function / is comp...
详细信息
On the basis of a set of new concepts called virtual data acquisition machine, the authors have developed a unique working environment for real-time data acquisition. they have tested this system in a biomedical appli...
详细信息
An Optically Interconnected distributed Shared Memory (OIDSM) system is introduced and analyzed in this paper. distributed shared memory systems place a heavy traffic requirement on the interconnection network. Comple...
详细信息
ISBN:
(纸本)0818626720
An Optically Interconnected distributed Shared Memory (OIDSM) system is introduced and analyzed in this paper. distributed shared memory systems place a heavy traffic requirement on the interconnection network. Complex memory allocation schemes have been introduced to reduce the network load. the photonic network of the system introduced in this paper alleviates the traffic load concern, and enables the development of a fixed memory allocation scheme with a significant reduction in complexity. the photonic network employs wavelength division multiple access (WDMA), creating multiple channels on a single optical fiber. this paper analyzes the performance of two memory allocation schemes through mean value analysis of a closed queueing network. the performance model is validated through simulation.
暂无评论