Browsing LCS Publications by Title
Now showing items 271-290 of 1163
-
Data Backup and Recovery in a Computer Architecture for Functional
(1985-10)The Vim computer system, an experimental project under development in the MIT/LCS Computation Structures Group, is intended to examine the efficient implementation of functional languages using the principles of data flow ... -
Data Communications via Cable Television Networks: Technical and Policy Considerations
(1982-05)Cable television networks offer peak communication data rates that are orders of magnitude greater than the telephone local loop. Although one-way television signal distribution continues to be the primary application of ... -
Data Driven Loops
(1980-08)The notion of the data driven loop arises in connection with our work in the Very High Level Language HIBOL and the automatic programming system (ProtoSystem I) that supports it. Although the concept is of general interest ... -
A Data Flow Architecture with Improved Asymptotic Performance
(1981-04)Large scale integration presents a unique opportunity to design a computer compromising large numbers of small, inexpensive processors. This paper presents a design for such a machine based on the asynchronous and functional ... -
Data Flow Computer Architecture Final Report
(1987-10)This report covers the work done by Computation Structures Group of the MIT Laboratory for Computer Science on developing models, languages, and architectures for data flow computation from 1966 to the end 1985. The work ... -
Data Model Equivalence
(1978-12)The current proliferation of proposals for database system data models and the desire for database systems which support several different data models raise many questions concerning "equivalence properties" of different ... -
Data Replication in Nested Transaction Systems
(1987-05)Gifford's basic Quorum Consensus algorithm for data replication is generalized to accommodate nested transactions and transaction failures (aborts). A formal description of the generalized algorithm is presented using the ... -
Data Sharing in Group Work
(1986-10)Data sharing is fundamental to computer-supported cooperative work: people share information through explicit communication channels and through their coordinated use of shared databases. Database support tools are therefore ... -
Data Structure Management in a Data Flow Computer System
(1985-05)VIM is an experimental computer system being developed at MIT for supporting functional programming. The execution mechanism of the computer is based on data flow. This thesis presents mechanisms for managing data ... -
Dataflow Architectures
(2/12/86)Dataflow graphs are described as a machine language for parallel machines. Static and dynamic dataflow architectures are presented as two implementations of the abstract dataflow model. Static dataflow allows at most one ... -
Deadlock Detection in Computer Networks
(1977-09)The problem of detecting process deadlocks is common to transaction oriented computer systems which allow data sharing. Several good algorithms exist for detecting process deadlocks in a single location facility. However, ... -
Deadlock-free Sharing of Resources in Asynchornous Systems
(1970-09)Whenever resources are shared among several activities that hoard resources, the activities can attain a state of deadlock in which, for lack of resources, none of the activities can proceed. Deadlocks can be prevented ... -
Debugging Distributed Computations in a Nest Atomic Action System
(1984-12)Concurrent and distributed programs are hard to debug. In this thesis, we argue that structuring activities as nested atomic actions can make debugging such programs much like debugging traditional sequential programs. ... -
Debugging Multithreaded Programs that Incorporate User-Level Locking
(1998-05)A multithreaded program with a bug may behave nondeterministically, and this nondeterminism typically makes the bug hard to localize. This thesis presents a debugging tool, the Nondeterminator-2, which automatically finds ... -
Decentralized Channel Management in Scalable Multihop Spread-Spectrum Packet Radio Networks
(1995-07)This thesis addresses the problems of managing the transmissions of stations in a spread-spectrum packet ratio network so that the system can remain effective when scaled to millions of nodes concentrated in a metropolitan ... -
Decidability of Equivalence for a Class of Data Flow Schemas
(1975-03)In this paper we examine a class of computation schemas and consider the problem of deciding when pairs of elements in this class represent equivalent programs. We are able to show that equivalence is decidable for a ... -
Decidability Questions for Petri Nets
(1976-06)An understanding of the mathematical properties of Petri Nets is essential when one wishes to use Petri Nets as an abstract model for concurrent systems. The decidability of various problems which arise in this context ... -
A Decidability Result for a Second Order Process Logic
(1978-09)We prove the decidability of the validity problem for a rather general language for talking about computations. As corollaries of our result, we obtain some decidability results of Pratt, Constable, Fischer-Ladner, and ... -
Decision Problems for Petri Nets and Vector Addition Systems
(1975-03)Petri Nets, Generalized Petri Nets, and Vector Addition Systems can represent each other and thus have common decideability problems. The graphical appeal of Petri Nets is used in a new presentation of the classical problems ... -
A Decision Procedure for the First Order Theory of Real Addition with Order
(1973-05)Consider the first order theory of the real numbers with the predicates + (plus) and < (less than). Let S be the set of true sentences. We first present an elimination of quantifiers decision procedure for S, and then ...
