The popular UNIX TM operating system provides time-sharing service on a single computer. This paper reports on the design and implementation of a distributed UNIX system. The new operating system consists of two compo...
详细信息
This paper considers a fixed (possibly infinite) set Π of distributed asynchronous processes which at various times are willing to communicate with each other. We describe probabilistic algorithms for synchronizing t...
详细信息
This paper describes an extension to the APL-S system that allows accessing directly from one host computer the files based on other computers tied to the same public network. APL-NET makes easy the development of dis...
详细信息
The proceedings contain 23 papers. The topics discussed include: modeling of problem domains for driving program development systems;programming primitives for database languages;paths: an abstract alternative to poin...
ISBN:
(纸本)089791029X
The proceedings contain 23 papers. The topics discussed include: modeling of problem domains for driving program development systems;programming primitives for database languages;paths: an abstract alternative to pointers;program improvement by internal specialization;paging as a 'language processing' task;position paper on optimizing compilers;making the world safe for garbage collection;carrier arrays: an idiom-preserving extension to APL;axiomatic definitions of programming languages, II;formal program testing;the temporal logic of branching time;program logic without binding is decidable;on the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem;a program development tool;program verification based on denotational semantics;incremental evaluation for attribute grammars with application to syntax-directed editors;linear cost is sometimes quadratic;a precise inter-procedural data flow algorithm;verification of attribute grammar;dependence graphs and compiler optimizations;program optimization and exception handling;and inferring types in Smalltalk.
For a decentralized computing system of many computing elements (whether geographically distributed mainframe computers, or miniature computing elements within a single board or even chip), a naturally decentralized m...
详细信息
This paper attempts to get at some of the fundamental properties' of distributedcomputing by means of the following question: "How much does each processor in a network of processors need to know about its o...
详细信息
The proceedings contain 47 papers. The topics discussed include: fast allocation of nearby resources in a distributed system;a decision method for the equivalence of some non-real-time deterministic pushdown automata;...
ISBN:
(纸本)0897910176
The proceedings contain 47 papers. The topics discussed include: fast allocation of nearby resources in a distributed system;a decision method for the equivalence of some non-real-time deterministic pushdown automata;logics for probabilistic programming;the consistency of 'P = NP' and related problems with fragments of number theory;on the distribution of independent formulae of number theory;complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations;dynamic algebras and the nature of induction;deadlock- and livelock-free packet switching networks;a complete axiomatization for a large class of dependencies in relational databases;horn clauses and database dependencies;kraft storage and access for list implementations;dynamically maintaining configurations in the plane;two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations;and time-space tradeoffs for some algebraic problems.
Owicki and Gries have developed a proof system for conditional critical regions. In their system, logically related variables accessed by more than one process are grouped together as resources, and processes are allo...
详细信息
Dijkstra's informally-stated Dining Philosophers problem [D] involves a number n of philosophers sitting in a circle, a single fork between each pair of adjacent philosophers. Any philosopher may decide to eat at ...
暂无评论