Results 1 - 10 of 1,603

Synchronization Primitives for a Multiprocessor: A Formal Specification

by A.D. Birrell, J.V. Guttag, J. J. Horning, R. Levin , 1987
"... Formal specifications of operating system interfaces can be a useful part of their documentation. We illustrate this by documenting the Threads synchronization primitives of the Taos operating system. We start with an informal description, present a way to formally specify interfaces in concurrent s ..."
Abstract - Cited by 40 (5 self) - Add to MetaCart
Formal specifications of operating system interfaces can be a useful part of their documentation. We illustrate this by documenting the Threads synchronization primitives of the Taos operating system. We start with an informal description, present a way to formally specify interfaces in concurrent

Network Time Protocol (Version 3) Specification, Implementation and Analysis

by David L. Mills , 1992
"... Note: This document consists of an approximate rendering in ASCII of the PostScript document of the same name. It is provided for convenience and for use in searches, etc. However, most tables, figures, equations and captions have not been rendered and the pagination and section headings are not ava ..."
Abstract - Cited by 520 (18 self) - Add to MetaCart
are not available. This document describes the Network Time Protocol (NTP), specifies its formal structure and summarizes information useful for its implementation. NTP provides the mechanisms to synchronize time and coordinate time distribution in a large, diverse internet operating at rates from mundane

Shared memory consistency models: A tutorial

by Sarita V. Adve, Kourosh Gharachorloo - IEEE Computer , 1996
"... Parallel systems that support the shared memory abstraction are becoming widely accepted in many areas of computing. Writing correct and efficient programs for such systems requires a formal specification of memory semantics, called a memory consistency model. The most intuitive model—sequential con ..."
Abstract - Cited by 441 (10 self) - Add to MetaCart
Parallel systems that support the shared memory abstraction are becoming widely accepted in many areas of computing. Writing correct and efficient programs for such systems requires a formal specification of memory semantics, called a memory consistency model. The most intuitive model

Synchronization Primitives for a Multiprocessor:

by A. D. Birrell, J. V. Guttag, J. J. Horning, R. Levin , 1987
"... educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of the Systems Research Center of Digital Equipment Corporation in Palo Alto, California; an acknowledgment of the authors and individual contributors t ..."
Abstract - Add to MetaCart
of their documentation. We illustrate this by documenting the Threads synchronization primitives of the Taos operating system. We start with an informal description, present away to formally specify interfaces in concurrent systems, and then give a formal speci�cation of the synchronization primitives. We brie�y discuss

An Object Calculus for Asynchronous Communication

by Kohei Honda, Mario Tokoro - Proceedings of the European Conference on Object-Oriented Programming (ECOOP , 1991
"... This paper presents a formal system based on the notion of objects and asynchronous communication. Built on Milner's work on ß-calculus, the communication primitive of the formal system is purely asynchronous, which makes it unique among various concurrency formalisms. Computationally this resu ..."
Abstract - Cited by 392 (35 self) - Add to MetaCart
This paper presents a formal system based on the notion of objects and asynchronous communication. Built on Milner's work on ß-calculus, the communication primitive of the formal system is purely asynchronous, which makes it unique among various concurrency formalisms. Computationally

Efficient Synchronization Primitives for large-scale cache-coherent multiprocessors

by James R. Goodman, Mary K. Vernon, Philip J. Wwst , 1989
"... AbstreetThis paper proposes a set of efficient primitives for process synchronization in muitiprocessors. The only assumptions made in developing the set of primitives are that hardware combining is not implemented in the hter-connect, and (in one case) that the interconnect supports broadcast. The ..."
Abstract - Cited by 159 (6 self) - Add to MetaCart
of processors while avoiding the cost of hardware combining. Scenarios for common synchronization events such as work queues and barriers are presented to demonstrate the generality and ease of use of the proposed primitives. The efficient implementation of the primitives is simpler if the multiprocessor has a

Parallel Mining of Association Rules

by Rakesh Agrawal, John C. Shafer - IEEE Transactions on Knowledge and Data Engineering , 1996
"... We consider the problem of mining association rules on a shared-nothing multiprocessor. We present three algorithms that explore a spectrum of trade-offs between computation, communication, memory usage, synchronization, and the use of problem-specific information. The best algorithm exhibits near p ..."
Abstract - Cited by 325 (3 self) - Add to MetaCart
We consider the problem of mining association rules on a shared-nothing multiprocessor. We present three algorithms that explore a spectrum of trade-offs between computation, communication, memory usage, synchronization, and the use of problem-specific information. The best algorithm exhibits near

Efficient Synchronization on Multiprocessors with Shared Memory

by Clyde P. Kruskal, Larry Rudolph, Marc Snir - ACM Transactions on Programming Languages and Systems , 1986
"... A new formalism is given for read-modify-write (RMW) synchronization operations. This formalism is used to extend the memory reference combining mechanism, introduced in the NYU Ultracomputer, to arbitrary RMW operations. A formal correctness proof of this combining mechanism is given. General requi ..."
Abstract - Cited by 93 (2 self) - Add to MetaCart
A new formalism is given for read-modify-write (RMW) synchronization operations. This formalism is used to extend the memory reference combining mechanism, introduced in the NYU Ultracomputer, to arbitrary RMW operations. A formal correctness proof of this combining mechanism is given. General

Synchronization and Communication in the T3E Multiprocessor

by Steven L. Scott , 1996
"... This paper describes the synchronization and communication primitives of the Cray T3E multiprocessor, a shared memory system scalable to 2048 processors. We discuss what we have learned from the T3D project (the predecessor to the T3E) and the rationale behind changes made for the T3E. We include pe ..."
Abstract - Cited by 145 (1 self) - Add to MetaCart
This paper describes the synchronization and communication primitives of the Cray T3E multiprocessor, a shared memory system scalable to 2048 processors. We discuss what we have learned from the T3D project (the predecessor to the T3E) and the rationale behind changes made for the T3E. We include

Synchronization and Storage Models for Multimedia Objects

by Thomas Dc Little, Arif Ghafoor - IEEE Journal on Selected Areas in Communications , 1990
"... Abstract–Multimedia computer systems are required to store, retrieve, and communicate objects comprised of mixed data types including images, text and voice. An important aspect of multimedia systems is the integration of elements retrieved from databases distributed across a network. Integration of ..."
Abstract - Cited by 217 (22 self) - Add to MetaCart
of object components requires consideration of the temporal characteristics of multimedia elements. We propose a technique for the formal specification and modeling of multimedia composi-tion with respect to intermedia timing. The proposed model is based on the logic of temporal intervals, and Timed Petri
Results 1 - 10 of 1,603