Browsing LCS Technical Memos (1974  2003) by Title
Now showing items 211230 of 492

I/O Automata: A Model for Discrete Event Systems
(198803) 
The Impact of Communication Locality on Largescale Multiprocessor Performance
(199202)As multiprocessor sizes scale and computer architects turn to interconnection networks with nonuniform communication latencies, the lure of exploiting communication locality to increase performance becomes inevitable. ... 
The Impact of Communication Locality on Largescale Multiprocessor Performance
(199206)As multiprocessor sizes scale and computer architects turn to interconnection networks with nonuniform communication latencies, the lure of exploiting communication locality to increase performance becomes inevitable. ... 
The Impact of Synchronous Communication on. The Problem of Electing a Leader in a Ring
(198404)We consider the problem of electing a leader in a synchronous ring of n processors. We obtain both positive and negative results. One the one hand, we show that if processor ID's are chosen from some countable set, then ... 
Impediments to Universal Preferencebased Default Theories
(198910)Research on nonmonotonic and default reasoning has identified several important criteria for preferring alternative default inferences. The theories of reasoning based on each of these criteria may uniformly be viewed as ... 
Implementing Internet Remost Logic on a Personal Computer
(198212)This thesis demonstrates that a desktop personal computer can support an efficient internet remote login implementation with the same protocols used by large mainframes. It describes a project in which the Telnet remote ... 
Implementing Sequentially Consistant Shared Objects using Broadcast and PointToPoint Communications
(199506)A distributed algorithm that implements a sequentially consistent collection of shared read/update objects using a combination of broadcast and pointtopoint communication is presented and proved correct. This algorithm ... 
The Implication Problem for Functional and Inclusion Dependencies
(198302)There are two implication problems for functional dependencies and inclusion dependencies: general implication and finite implication. Given a set of dependencies ∑∪{σ}, the problems are to determine whether σ holds in all ... 
Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees
(197511)A binary search tree can be used to store data in a computer system for retrieval by name. Different elements in the tree may be referenced with different probabilities. If we define the cost of the tree as the average ... 
An Improved Overlap Argument for Online Multiplication
(197401)A lower bound of cN1ogN is proved for the mean time complexity of an online multitape Turing machine performing the multiplication of Ndigit binary integers. For a more general class of machines the corresponding bound ... 
An Improved Proof of the RabinHarmanisStearns Conjecture
(197901)We offer an improved presentation of Aanderaa's constructive proof of the RabinHartmanisStearns conjecture: For all k≥2, there exists a language Lk such that Lk can be recoginzed by a kworktape real time Turing machine ... 
Improvements of Yao's Results on Parity Circuits
(198509) 
Improving Information Storage Reliability Using a Data Network
(197610)Backup and recovery methods using magnetic tapes are common in computer utilities, since information stored online is subject to damage. The serial access nature of the tape medium severely restricts the flexibility and ... 
Indolent Closure Creation
(199806)A closure is a representation of a thread in memory, ready to be executed. The goal of this work is to create portable closures that can be transferred across binary incompatible architectures. Consequently, indolent ... 
Inferring Decision Trees Using the Minimum Description Length Principle
(198709)We explore the use of Rissanen's Minimum Description Length Principle for the construction of decision trees. Empirical results comparing this approach to other methods are given. 
An Information Theoretic Approach for Shared Bottleneck Inference Based on Endtoend Measurements
(200003)Recent years have marked a growing interest in studying Internet path characteristics. However, most of the currently available tools to an end system to perform such measurements are slow inaccurate and generate an excessive ... 
Integrating Messagepassing and Sharedmemory: Early Experience
(199210)This paper discusses some of the issues involved in implementing a sharedaddress space programming model on largescale, distributedmemory multiprocessors. Because messagepassing mechanisms are much more efficient than ... 
The Integration of the Organization Engine and Library 2000
(199205)In the contemporary research environment, users access and manipulate information gathered from diverse data sources. The organization Engine is a prototype being developed at the Cambridge Research Lab of Digital Equipment ... 
Interactive Design Coordination for the Building Industry
(197006)The problem of effective communication in the process of building design and construction is widely recognized. The involvement of several design disciplines combined with the tendency for designers to work in distinct ...