Learn More
Most of recent research on distributed shared memory (DSM) systems have focused on either careful design of node controllers or cache coherence protocols. While evaluating these designs, simplified models of networks (constant latency or average latency based on the network size) are typically used. Such models completely ignore network contention. To help(More)
Shared memory multiprocessors play an increasingly important role in enterprise and scientific computing facilities. Remote misses limit the performance of shared memory applications, and their significance is growing as network latency increases relative to processor speeds. This paper proposes two mechanisms that improve shared memory performance by(More)
Directory-based distributed shared memory (DSM) systems have drawn high interests in parallel computing research and industry in recent years. Current generation systems are limited to using point-to-point messages for cache invalidation requests and associated acknowledgments. Such an approach incurs a large number of control messages, heavy network traac,(More)
Components of modern parallel systems are becoming quite complex with many features and variations. An integrated modeling of these components (interconnection network, messaging layer, programming model, and computation-communication characteristics of applications) is essential to derive design guidelines for next generation parallel systems. Most of the(More)
Directory-based distributed shared memory (DSM) systems have drawn high interests in parallel computing research and industry in recent years. Current generation systems are limited to using point-to-point messages for cache invalidation requests and associated acknowledgments. Such an approach incurs a large number of control messages, heavy network traac,(More)
Many research results in recent years have focused on the design of distributed shared memory (DSM) systems. However, most of these results are centered around either careful design of node controllers or cache coherence protocols. While evaluating these designs, simpliied models of networks (constant network latency or average latency based on the network(More)
We consider here two basic fault-secure scheduling problems for multiprocessor systems. First, given the number of processors in the system and a set of computational tasks of unit length expressed as a complete binary tree, a scheduling algorithm is proposed such that the total execution time is a minimum and no undetected single error result will be(More)
A cost-eeective distributed shared memory (DSM) system typically uses a limited directory protocol to enforce cache coherence. This paper presents a new family of protocols, called Limited directory with Region-based Broadcast (Limited-RB), to eeciently implement cache coherence in wormhole routed DSM systems. This protocol family uses(More)
Networks of workstations (NOWs) are becoming increasingly popular as an alternative to parallel computers. Typically , these networks present irregular topologies, providing the wiring flexibility, scalability, and incremental expansion capability required in this environment. Similar to the evolution of parallel computers, NOWs are also evolving from(More)