Browsing LCS Publications by Title
Now showing items 1118-1137 of 1163
-
UDM: User Direct Messaging for General-Purpose Multiprocessing
(1996-03)User Direct Messaging (UDM) allows user-level, processor-to- processor messaging to coexist with general multiprogramming and virtual memory. Direct messaging, where processors launch and receive messages in tens of cycles ... -
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
(1986-09)A new model for weak random physical sources is presented. The new model strictly generalizes previous models (e.g. the Santha and Vazirani model [26]). The sources considered output strings according to probability ... -
Understanding ALGOL: A View of a Recent Convert to Denotational Semantics
(1983-10)The advantages of denotational over copy-rule semantics are argued. A denotational semantics is indicated for an ALGOL-like language with finite-mode procedures, blocks with local storage, and sharing (aliasing). Procedure ... -
A Unified Framework for Schedule and Storage Optimization
(2000-11)We present a unified mathematical framework for analyzing the tradeoffs between parallelism and storage allocation within a parallelizing compiler. Using this framework, we show how to find the best storage mapping for a ... -
Use of CTSS in a Teaching Environment
(1964-11)Computer time-sharing offers many interesting possibilities for use in teaching computer technology. It might be expected that with proper hardware and software, students using time-sharing as a teaching machine could ... -
The Use of Distinctive Features for Automatic Speech Recognition
(1991-09)One of the most critical and yet unsolved problems in phonetic recognition is the transformation of the continuous speech signal to a discrete representation for accessing words in the lexicon. In order to find an efficient ... -
Use of High Level Languages for Sytems Programming
(1970-09)(This paper is a slightly edited version of a transcript so that it still contains the colloquial flavor of the oral presentation.) I'm going to talk about languages for systems programming what they can do for us, and ... -
The Use of Queues in the Parallel Data Flow Evaluation of "If-Then-While" Programs
(1978-05)A property of a model of parallel computation is analyzed. We show that the use of queues may speed-up the execution of well formed data flow schemas by an arbitrarily large factor. A general model of data flow computation ... -
The Use of the Domain Name System for Dynamic References in an Online Library
(1994-05)Persistent, dynamic references (or links) to remove documents are an essential part of an online library. This thesis examines two distributed database systems, X.500 and the Domain Name System(DNS), upon which to build ... -
A User's Guide to the Macro Control Language
(1973-12) -
Using Cycles and Scaling in Parallel Algorithms
(1989-08)We introduce the technique of decomposing an undirected graph by finding a maximal set of edge-disjoint cycles. We give a parallel algorithm to find this decomposition in O(log n) time on (m+ n)/log n processors. We ... -
Using Interactive Graphics in Simulating the Hospital Emergency Room
(1974-05)The hospital emergency room is a complex system having many interrelated factors contributing to its operation. The emergency room administrator has limited control over certain of these factors: numbers of beds, nurses, ... -
Using Non-interactive Proofs to Achieve Independence Efficiently and Securely
(1994-11)Independence or simultaneous broadcast is a fundamental tool to achieve security in fault tolerant distributed computing. It allows n players to commit to independently chosen values. In this paper we present a constant ... -
Using Specifications to Check Source Code
(1994-06) -
Using Type Extension to Organize Virtual Memory Mechanisms
(1976-09)Much effort is currently being devoted to producing systems that are easy to understand, to verify and to develop. The general methodology for designing such a system consists of decomposing it into a structured set of ... -
Using Untypes Lambda Calculus to Computer with Atoms
(1984-02)Axioms and verification rules are given for typeless A -calculus with a conditional test for equality between atoms. A semantic completeness theorem is proved and a deterministic evaluator is proposed. -
VAL- A Value-oriented Algorithmic Language: Preliminary Reference Manual
(1979-06)The programming language VAL (Value-Oriented Algorithmic Language) is designed for expressing algorithms for execution on computers capable of highly concurrent operation. More specifically, the application area to be ... -
Verbal and Graphical Language for the AED System: A Progress Report
(1964-05)For Computer-Aided Design, use of time-sharing a single language which can take either verbal or graphical form is required. This paper describes how a single language processing technique, which is in turn a special ... -
Verifiable Secret Sharing as Secure Computation
(1994-03)We present a stronger notion of verifiable secret sharing and exhibit a protocol implementing it. We show that our new notion is preferable to the old ones whenever verifiable secret sharing is used as a tool within larger ...