Traditional broadcast protocols are inappropriate for the high-speed networks of the future. Such protocols are limited by the speed of software processing, which becomes a bottleneck as network speeds increase. This paper presents broadcast protocols that are appropriate for high-speed networks, and are tolerant of failures involving the loss of messages. The protocols are based primarily on the simple hardware functions present in a high-speed network node. This leads to message delivery at hardware speeds. In the unlikely event of a failure, software intervention is required to guarantee the timely termination of the protocol; however, this software processing does not interfere with message delivery.

Advanced general purpose parallel systems should be able to support diverse applications with different resource requirements without compromising effectiveness and efficiency. We present a resource management model for cluster computing that allows multiple scheduling policies to co-exist dynamically. In particular, we have built Octopus, an extensible and distributed hierarchical scheduler that implements new space sharing, gang scheduling and load sharing strategies. A series of experiments performed on an IBM SP2 suggest that Octopus can effectively match application requirements to available resources, and improve the performance of a variety of parallel applications within a cluster.

We describe the design and implementation of the Concert/C compiler and runtime. We describe solutions to the problems of (1) how to extend a language without compromising the use of legacy source and object code and tools, (2) how to extract language-neutral interface information from native language type declarations, (3) how to make function pointers into first-class values transmissable over a network while retaining runtime compatibility with plain C, and (4) how to interoperate with multiple RPC and messaging protocols, selecting protocols at runtime, with little sacrifice of efficiency.>

A model and a notation are developed for specifying the composition of concurrent programs. The work is based on the observation that the composition of concurrent programs often requires not only intraprocessor coordination but also interprocessor coordination. A notation is developed for explicitly specifying both forms of coordination within a single uniform framework. Much prior work has either ignored the interprocessor coordination aspects of composition, or treated it in a manner separate from the intraprocessor coordination aspects.>

In this paper we combine two previously disparate aspects of reliable distributed computing -selfstabllization, i.e., tolerance of systemic failures, and fault-tolerance, i.e., tolerance of process failures.We define what it means for a protocol to solve a problem while tolerating both types of failures and demonstrate a "compiler" that transforms a process failuretolerant protocol for a synchronous system into a process and systemic failure-tolerant protocol.For asynchronous systems, we present a protocol that solves a crucial problem (Consensus) while tolerating both process and systemic failures.

Article Free Access Share on Inconsistency and contamination (preliminary version) Authors: Ajei Gopal Department of Computer Science, Cornell University, Ithaca, New York Department of Computer Science, Cornell University, Ithaca, New YorkView Profile , Sam Toueg Department of Computer Science, Cornell University, Ithaca, New York Department of Computer Science, Cornell University, Ithaca, New YorkView Profile Authors Info & Claims PODC '91: Proceedings of the tenth annual ACM symposium on Principles of distributed computingJuly 1991 Pages 257–272https://doi.org/10.1145/112600.112622Published:01 July 1991Publication History 12citation189DownloadsMetricsTotal Citations12Total Downloads189Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

a software search is required to determine whether or not to forward the message.With increasing network speed, this search becomes a bottleneck.There are two approaches to overcoming this bottleneck.The first approach is to implement the search described above directly in very high speed hardware; unfortunately, such a solution may not be cost-effective.The second approach, the one we have chosen, is to devise a new broadcast protocol that does not require such a search.This paper presents a ~asf distributed broadcast protocol for a high speed, arbitrary topology, point-to-point network.The protocol uses simple hardware switching functions to perform a,

The current trend in network technology is to implement as much of the switching function as possible directly in specialized high-speed hardware. A broadcast algorithm for such a network that is tolerant of failures in the form of message loss is presented. The model used is based on the one introduced by Cidon et al. (see Proc. of Seventh Annual ACM Symp. on Principles of Distributed Comput., Toronto, Canada. P.75-89, 1988); the hardware functions assumed are simple enough to be implemented in high-speed logic. The basic idea is to forward broadcast messages directly in hardware, thereby avoiding software-introduced delays. Software intervention (possible only after the broadcasted message has already been forwarded) is required only to ensure termination in case of failures. With high probability, the broadcast will terminate in time O(n tau /sub max/), where n is the number of nodes and tau /sub max/ is an upper bound on (variable) message delivery time across a link.>

Article Free Access Share on Early-delivery atomic broadcast Authors: Ajei Gopal Cornell University Cornell UniversityView Profile , Ray Strong IBM ARC IBM ARCView Profile , Sam Toueg Cornell University Cornell UniversityView Profile , Flaviu Cristian IBM ARC IBM ARCView Profile Authors Info & Claims PODC '90: Proceedings of the ninth annual ACM symposium on Principles of distributed computingAugust 1990 Pages 297–309https://doi.org/10.1145/93385.93430Published:01 August 1990Publication History 16citation324DownloadsMetricsTotal Citations16Total Downloads324Last 12 Months9Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF