作者：
Kim, K.H.Univ of South Florida
Dep of Computer Science & Engineering Tampa FL USA Univ of South Florida Dep of Computer Science & Engineering Tampa FL USA
One of the frequently advocated advantages of distributedcomputing systems over centralized computing systems is the improved system reliability potential. Although the application of distributedcomputing is current...
详细信息
One of the frequently advocated advantages of distributedcomputing systems over centralized computing systems is the improved system reliability potential. Although the application of distributedcomputing is currently expanding at a rapid rate, the realization of its full reliability potential still requires more fresh solutions and further understanding of many design problems. The nature of some of those design issues are briefly discussed. In order to help preventing misinterpretations while maintaining abstract tones in presentation of research issues, a model of recoverable distributedcomputing system structure is presented. Discussed are: error detection, hardware and software reconfiguration, the degree of coordinating distributed processes for error detection and recovery;real-time recovery and software engineering tools.
The problem of automatic storage reclamation for distributed implementations of applicative languages is explored. Highly parallel distributed systems have several unique characteristics that complicate the reclamatio...
详细信息
The proceedings contain 36 papers. The topics discussed include: multilevel atomicity;compatible attributes in a universal relation;transforming cyclic schemas into trees;sacrificing serializability to attain high ava...
ISBN:
(纸本)0897910702
The proceedings contain 36 papers. The topics discussed include: multilevel atomicity;compatible attributes in a universal relation;transforming cyclic schemas into trees;sacrificing serializability to attain high availability of data in an unreliable network;database relations with null values;assumptions in relational database theory;connections in acyclic hypergraphs;the U.R. strikes back;on equivalences of database schemes;the tree property is fundamental for query processing;on concurrency control by multiple versions;concurrency on high-traffic data elements;remarks on the algebra of non first normal form relations;non-reversible privacy transformations;an algorithm for minimizing roll back cost;an extended relational algebra with control over duplicate elimination;an optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems;is distributed locking harder?;the relational model of data and cylindrical algebras;notions of dependency satisfaction;inclusion dependencies and their interaction with functional dependencies;horn clauses and the fixpoint query hierarchy;and testing containment of conjunctive queries under functional and inclusion dependencies.
Some ideas on the construction of user applications as atomic actions are developed. Atomic actions that last a long time pose several problems if conventional ideas on concurrency control and recovery are applied. Wh...
详细信息
Some ideas on the construction of user applications as atomic actions are developed. Atomic actions that last a long time pose several problems if conventional ideas on concurrency control and recovery are applied. What is required is some means of delaying commitment without sacrificing performance. A model is proposed in which it is possible for an action to release and process as yet uncommitable objects. The impact of this on recovery is also discussed.
One can partition the class of relational database schemas into tree schemas and cyclic schemas. In this paper we examine query processing implications of the partitioning;other areas impacted include dependency theor...
详细信息
The proceedings contain 38 papers. The topics discussed include: extended naming conventions for communicating processes;programming aspects of VLSI;termination of probabilistic concurrent programs;optimal code for co...
ISBN:
(纸本)0897910656
The proceedings contain 38 papers. The topics discussed include: extended naming conventions for communicating processes;programming aspects of VLSI;termination of probabilistic concurrent programs;optimal code for control structures;unbounded speed variability in distributed communication systems;messages as active agents;automatic generation of machine specific code optimizers;a flexible approach to interprocedural data flow analysis and programs with recursive data structures;specification and synthesis of communicating processes using an extended temporal logic;guardians and actions: linguistic support for robust, distributed programs;a type declaration and inference system for Smalltalk;code generation and reorganization in the presence of pipeline constraints;unified dialogue management in the carousel system;eliminating redundant object code;lithe: a language combining a flexible syntax and classes;description -driven code generation using attribute grammars;experience with an attribute grammar-based compiler;optimal-time incremental semantic analysis for syntax-directed editors;and maple: a programming language and operating system.
Many of the special problems in distributedcomputing relate to the handling of exceptional conditions. In a distributed program exceptions occur as a result of transmission errors and partial failures. Any exceptiona...
详细信息
Many of the special problems in distributedcomputing relate to the handling of exceptional conditions. In a distributed program exceptions occur as a result of transmission errors and partial failures. Any exceptional condition that arises must be handled if distributed programs are to be robust. Various approaches are examined towards providing exception handling mechanisms for distributed applications which were incorporated into several experimental distributed operating systems. These operating systems all support the notion that the primary software structuring tool for applications will be a collection of cooperating programs (processes) mapped onto a set of loosely coupled processors.
The concept of atomic transactions has been used to provide reliable processing in both centralized and distributed systems. An extension of traditional atomic transactions is presented: nested transactions. Nested tr...
详细信息
The concept of atomic transactions has been used to provide reliable processing in both centralized and distributed systems. An extension of traditional atomic transactions is presented: nested transactions. Nested transactions are seen to permit safe concurrency within as well as among transactions, and to enable transactions to fail partially in a graceful and controlled manner. These properties of nested transactions suit them to a number of distributed applications. Examples of such applications are described.
In this paper, we investigate the power of such broadcast in solving a paradigmatic problem in distributedcomputing. Imagine a network in which each node machine Ni (1≤i≤n) keeps a Boolean value vi in local memory....
详细信息
The proceedings contain 29 papers. The topics discussed include: expressions as processes;a fixed-program machine for combinator expression evaluation;implementation of InterLISP on the VAX;combinatory foundation of f...
ISBN:
(纸本)0897910826
The proceedings contain 29 papers. The topics discussed include: expressions as processes;a fixed-program machine for combinator expression evaluation;implementation of InterLISP on the VAX;combinatory foundation of functional programming;super-combinators a new implementation method for applicative languages;experiments with a supercompiler;a parallel PROLOG: the construction of a data driven model;how to define a language using PROLOG;logic enhancement: a method for extending logic programming languages;functional specifications of a Text Editor;T: a dialect of LISP or lambda: the ultimate software tool;an investigation of the relative efficiencies of combinators and lambda expressions;an overview of common LISP;PSL: a portable LISP system;improved effectiveness from a real time LISP garbage collector;prolog compared with LISP;performance of LISP systems;S-I common LISP implementation;garbage collection and task deletion in distributed applicative processing systems;functional geometry;and a scheme for implementing functional values on a stack machine.
暂无评论