the justification, design, and performance of the Stealthdistributed Scheduler is discussed. the goal of Stealth is to exploit the unused computing capacity of a workstation-based distributed system (WDS) without und...
详细信息
ISBN:
(纸本)0818621443
the justification, design, and performance of the Stealthdistributed Scheduler is discussed. the goal of Stealth is to exploit the unused computing capacity of a workstation-based distributed system (WDS) without undermining the predictability in quality of service that a WDS provides to workstation owners. It is shown that the liberal approach taken by the Stealthdistributed Scheduler is a promising method of exploiting the vast quantity of unused computing capacity typically present in a WDS, while preserving predictability of service for workstation owners.
A simple owner protocol for implementing a causal distributed shared memory (DSM) is presented, and it is argued that this implementation is more efficient than comparable coherent DSM implementations. Moreover, it is...
详细信息
ISBN:
(纸本)0818621443
A simple owner protocol for implementing a causal distributed shared memory (DSM) is presented, and it is argued that this implementation is more efficient than comparable coherent DSM implementations. Moreover, it is shown that writing programs for causal memory is no more difficult than writing programs for atomic shared memory.
A language has been developed for queries which serves as an extension of the browsing model of hypertext systems. the query language and data model fit naturally into a distributed environment. A simple and efficient...
详细信息
ISBN:
(纸本)0818621443
A language has been developed for queries which serves as an extension of the browsing model of hypertext systems. the query language and data model fit naturally into a distributed environment. A simple and efficient method is discussed for processing distributed queries in this language. Results of experiments run on a distributed data server using this algorithm are presented.
A general framework is developed for reconfiguring applications dynamically, where developers may alter the application without loss of service. After presenting the overall framework within which reconfiguration is p...
详细信息
ISBN:
(纸本)0818621443
A general framework is developed for reconfiguring applications dynamically, where developers may alter the application without loss of service. After presenting the overall framework within which reconfiguration is possible, a description is given of the formal approach for programmers to capture the state of a process abstractly. An environment to support experimentation with dynamic reconfiguration is then described.
A synchronization algorithm is proposed which uses one of two probabilistic techniques to estimate remote clock values, and uses an interactive convergence algorithm on the resulting estimates to adjust the local cloc...
详细信息
ISBN:
(纸本)0818621443
A synchronization algorithm is proposed which uses one of two probabilistic techniques to estimate remote clock values, and uses an interactive convergence algorithm on the resulting estimates to adjust the local clock. the algorithm does not require master/slave clocks and reduces the number of messages needed. As a result it is suitable for use in large distributed systems.
Algorithms for solving the processor membership problem in asynchronous distributed systems that are subject to processor and communication faults are presented. these algorithms are based on the placement of a total ...
详细信息
ISBN:
(纸本)0818621443
Algorithms for solving the processor membership problem in asynchronous distributed systems that are subject to processor and communication faults are presented. these algorithms are based on the placement of a total order on broadcast messages. the types of systems for which each of these algorithms is appropriate are characterized in terms of the properties of the communication mechanisms and the availability of stable storage. In the absence of stable storage or a mechanism for distinguishing promptly delivery messages, it is shown that no membership algorithm exists.
Two principles are proposed for proving and tracing distributed programs: it is necessary to assert in proofs only what can be readily traced, and trace just what can be asserted in the proofs. A proof system and trac...
详细信息
ISBN:
(纸本)0818621443
Two principles are proposed for proving and tracing distributed programs: it is necessary to assert in proofs only what can be readily traced, and trace just what can be asserted in the proofs. A proof system and tracing strategy are described for CSP programs based on these principles, using vector time and control variables, not auxiliary variables, to represent control state, and stressing local rather than global reasoning.
For efficient construction of the distributed database from media failure, a transaction-consistent checkpointing algorithm is proposed for heterogeneous distributed database systems. For full design autonomy and incr...
详细信息
ISBN:
(纸本)0818621443
For efficient construction of the distributed database from media failure, a transaction-consistent checkpointing algorithm is proposed for heterogeneous distributed database systems. For full design autonomy and increased availability on the heterogeneous distributed database systems, the proposed algorithm never enforces termination of normal operations of transactions and changes of checkpointing algorithms in local database systems. the global checkpoints generated by the algorithm can be used to reconstruct the previous consistent states of a database efficiently.
A token-based mutual exclusion algorithm is presented which uses data structures similar to coteries, called quorum agreements. the performance of the algorithm depends on the quorum agreements used. When a good quoru...
详细信息
ISBN:
(纸本)0818621443
A token-based mutual exclusion algorithm is presented which uses data structures similar to coteries, called quorum agreements. the performance of the algorithm depends on the quorum agreements used. When a good quorum agreement is used, the overall performance of the algorithm compares favorably withthe performance of other mutual exclusion algorithms.
distributed concurrency control has been implemented by representing in-progress transactions as simulated objects, called transaction objects, that use normal message passing facilities. the implementation of an opti...
详细信息
ISBN:
(纸本)0818621443
distributed concurrency control has been implemented by representing in-progress transactions as simulated objects, called transaction objects, that use normal message passing facilities. the implementation of an optimistic mechanism has been completed using transaction objects and a two-phase locking mechanism has been designed. the tradeoffs made and lessons learned, dealing with transactions both on objects and as objects, are discussed.
暂无评论