By Topic

[1991] Proceedings. 11th International Conference on Distributed Computing Systems

20-24 May 1991

Filter Results

Displaying Results 1 - 25 of 74
  • 11th International Conference on Distributed Computing Systems (Cat. No.91CH2996-7)

    Publication Year: 1991, Page(s): 0_1
    Request permission for commercial reuse | PDF file iconPDF (14 KB)
    Freely Available from IEEE
  • DisCo specification language: marriage of actions and objects

    Publication Year: 1991, Page(s):142 - 151
    Cited by:  Papers (10)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1016 KB)

    The potential of the action-oriented paradigm has been explored in the development of a specification language, DisCo, which can be characterized as both action-oriented and object-oriented. Its possibilities are introduced by contrasting them to the more familiar process-oriented approaches. Its execution model is state-based and leads to direct application of temporal logic in formal reasoning. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An object-oriented approach to formal specification of reactive systems

    Publication Year: 1991, Page(s):134 - 141
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    An object-oriented approach to formal specification of reactive systems is described. The main contributions of the work are: a language for specifying and implementing reactive modules; inheritance operations for such specifications and implementations; a formal semantics for such reactive programs and for the inheritance operations in terms of partial orders of events; treatment of specification... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Models of parallel learning systems

    Publication Year: 1991, Page(s):125 - 132
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    The technique of parallel processing is applied to concept learning. The learning strategies can be divided into two classes: top-down learning and bottom-up learning. Based on the partition of learning tasks on the multiple processors and the principle of divide-and-conquer, respectively, two corresponding parallel learning models are proposed. It is shown that these two models can be easily embe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of transaction scheduling policies for parallel database systems

    Publication Year: 1991, Page(s):116 - 124
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    The impact of transaction scheduling in the shared-nothing type of architecture is studied. An abstract model of the shared-nothing type of architecture is used. Four transaction scheduling policies are considered. These policies can be broadly divided into two classes: policies that work independent of the current system state and policies that use the current system state information. The author... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximations of the mean resequencing waiting time in M/GI/c systems

    Publication Year: 1991, Page(s):28 - 35
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    The problem of obtaining approximate formulas for mean resequencing waiting times of M/GI/c queueing systems is considered. Two assumptions, commonly used in the study of M/GI/c systems, to derive the formulas are adopted. The formulas are quite accurate and the accuracy increases as c becomes larger. The relative differences between simulation results and the ones calc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting problem dynamics through result sharing in dataflow environments

    Publication Year: 1991, Page(s):108 - 115
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    The notion of CPRS (concurrent processing which result sharing) graph decomposition is presented which is based on problem dynamics, and the validity of the CPRS scheme in a dataflow environment is explored. A dynamic dataflow architecture to execute programs under the new model of computation, called the CPRS architecture, is presented. An analytical modeling, based on a closed queueing network m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing on generalized hypercube and mesh multiprocessors with LAL

    Publication Year: 1991, Page(s):402 - 409
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    A typical nearest neighbor balancing strategy, called LAL (local average load), in which the workload of a processor is averaged among its nearest neighbors at discrete time steps is investigated. The underlying systems considered are multiprocessor systems interconnected by generalized hypercube (GHC), mesh and loop structures. It is assumed that the amount of computation tasks arriving at or fin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting the development of network programs

    Publication Year: 1991, Page(s):641 - 648
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    Programmers who want to do network computing face several challenges: the network and attached systems are shared resources with an unpredictable behavior and network communication primitives are often hard to use. The programming environment developed for the Nectar system addresses both problems. It provides simple and efficient communication primitives, and an efficient monitoring kernel that a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heterogeneous process migration by recompilation

    Publication Year: 1991, Page(s):18 - 25
    Cited by:  Papers (26)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    An approach to heterogeneous process migration that involves building a machine-independent migration program that specifies the current code and data state of the process to be migrated is described. When this program is compiled and executed on the target machine, it will first reconstruct the process's state and then continue the normal execution of the now-migrated process. The principal advan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Crash recovery with little overhead

    Publication Year: 1991, Page(s):454 - 461
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    Recovering from processor failures in distributed systems is an important problem in the design and development of reliable systems. Two solutions to this problem which involve very little overhead are presented. Without appending any information to the messages of the application program, it is shown that it is possible to recover from failures using O(|V| |E|) messages where |V| is the number of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model of naming for fine-grained service specification in distributed systems

    Publication Year: 1991, Page(s):98 - 105
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    A syntax-oriented model for naming feature-based specification of services is provided. The model allows a service to evolve or reconfigure in functionality by adding and removing features and still coexist with its previous versions. The model's two aspects are examined. With this model for specifying services, name server functions may be factorized from service specific functions and implemente... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processor allocation vs. job scheduling on hypercube computers

    Publication Year: 1991, Page(s):394 - 401
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The roles of processor allocation and job scheduling in achieving good performance on hypercube computers are compared. It is shown that the choice of job scheduling discipline has a dramatic effect on performance. A family of scheduling disciplines, called Scan, with particular performance advantages is proposed. Furthermore, it is shown that if Scan scheduling is used, the choice of processor al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel programming: achieving portability through abstraction

    Publication Year: 1991, Page(s):634 - 640
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    An introduction to the Unity syntax and logic is given. The idea of abstract programs is outlined. Examples are used to illustrate the usefulness of abstract programs. These are: sorting an array and summing an array View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BNB self-routing permutation network

    Publication Year: 1991, Page(s):574 - 581
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    A self-routing permutation network capable of routing all n factorial permutations of its n inputs to its n outputs is presented. The network implements the binary radix sorting on the structure of the generalized baseline network, a modified model of the original baseline network. The network has O(N log 3 N) hardware complexity an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing consistency control mechanisms in the Clouds distributed operating system

    Publication Year: 1991, Page(s):10 - 17
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Implementation of a kernel-level consistency control mechanism called invocation-based consistency control (IBCC) is presented. IBCC supports general-purpose persistent object-based distributed computing. It provides mechanisms that support a range of powerful, well-defined consistency semantics. IBCC mechanisms can also be used to implement custom recovery and synchronization. An operating-system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rectifying corrupted files in distributed file systems

    Publication Year: 1991, Page(s):446 - 453
    Cited by:  Papers (2)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A probabilistic comparison algorithm is presented which requires O(f log n) bits to be transmitted to identify the corrupt pages in a file (where n is the number of pages and f is the maximum number of pages that could be corrupted), which improves on previous results on the growth of communicated bits as functions of both n and of f. If both c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Critical factors in NUMA memory management

    Publication Year: 1991, Page(s):500 - 507
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    The authors identify and incorporate the critical factors that influence nonuniform memory access (NUMA) memory management into their performance metrics. Using trace-driven simulations, it is shown that under certain conditions no replication is better than replication. It is also concluded that the effectiveness of replication depends on: (1) the ratio of access times to remote and local memory,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A checkpointing scheme for heterogeneous distributed database systems

    Publication Year: 1991, Page(s):608 - 615
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    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 checkpointi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A service acquisition mechanism for the client/service model in Cygnus

    Publication Year: 1991, Page(s):90 - 97
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    Three of the most important issues in exploiting network servers concern how to specify services so that service-server bindings can be changed dynamically without disturbing clients, how to make clients resilient to network or server failure, and how to accommodate server protocol heterogeneity to provide a single system view to the clients. A service acquisition mechanism is presented for solvin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Stealth distributed scheduler

    Publication Year: 1991, Page(s):336 - 343
    Cited by:  Papers (39)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    The justification, design, and performance of the Stealth distributed 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 Stealth distributed scheduler is a prom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static analysis of concurrent software for deriving synchronization constraints

    Publication Year: 1991, Page(s):544 - 551
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    A static analysis method is introduced for detecting synchronization errors. This method is to derive constraints on the feasible synchronization sequences of a concurrent program (or program module) P according to P's syntactic and semantic information. These constraints, called feasibility constraints for P, can be compared with constraints in the specification of P to detect specification-depen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling wormhole routing in a hypercube

    Publication Year: 1991, Page(s):386 - 393
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    An analytical model for the performance evaluation of asynchronous hypercubes is presented. This analysis is aimed at modeling a deadlock-free wormhole routing scheme prevalent on second-generation hypercube systems. Probability of blocking and average message delay are discussed. The communication traffic to find the probability of blocking is the starting point. The traffic analysis can capture ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated design, simulation, and verification of real-time systems

    Publication Year: 1991, Page(s):164 - 171
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    The goal of this research is to develop a design methodology that allows performance characteristics of a system to be monitored through all stages of its development, from initial design to system deployment. The use of partially implemented performance specifications (PIPS) as the design paradigm for real-time systems is proposed. A PIPS model is a partially implemented system where some system ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using multiple replica classes to improve performance in distributed systems

    Publication Year: 1991, Page(s):420 - 428
    Cited by:  Papers (4)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    Replication has been primarily used as a means of increasing availability in distributed systems. It is known that replication can mitigate the costs of accessing remotely stored data in distributed systems. Replication control protocols in the literature have stopped short of addressing availability and performance concerns. These issues are addressed by contributing a classification of replicas ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.