Journal of Parallel and Distributed Computing

Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O(N ), where 2< 3. We show that such an algorithm can be parallelized on a distributed memory parallel computer (DMPC) in O(logN) time by using ...

This paper presents a family of simulators for data-intensive applications, and a methodology to select the most efficient simulator based on a user-supplied requirement for accuracy. The methodology consists of a series of tests that select an ...

Very fast and accurate 3-D capacitance extraction is essential for interconnect optimization in VLSI ultra-deep sub-micron designs (UDSM). Parallel processing provides an approach to reducing the simulation turn-around time. This paper examines the ...

Cache coherence enforcement and memory latency reduction and hiding are very important and challenging problems in the design of large-scale distributed shared-memory (DSM) multiprocessors. We propose an integrated approach to solve these problems ...

As machines and programs have become more complex, the process of programming applications that can exploit the power of high-performance systems has become more difficult and correspondingly more labor-intensive. This has substantially widened the ...

This is a report on a panel titled “What are the top ten most influential parallel and distributed processing concepts of the last millennium?” that was held at the IEEE Computer Society sponsored “14th International Parallel and Distributed Processing ...