[1992] Proceedings of the 12th International Conference on Distributed Computing Systems

9-12 June 1992

Filter Results

Displaying Results 1 - 25 of 86
  • Proceedings of the 12th International Conference on Distributed Computing Systems (Cat No.92CH3175-7)

    Publication Year: 1992
    Request permission for commercial reuse | |PDF file iconPDF (25 KB)
    Freely Available from IEEE
  • Asynchronous unison

    Publication Year: 1992, Page(s):486 - 493
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (536 KB)

    Unbounded and bounded designs of asynchronous unison systems are discussed. It is shown that both systems are stabilizing in the sense that their steady state behaviors do not depend on their initial states. The systems can therefore tolerate memory and reconfiguration faults that may yield them in arbitrary states. It is also shown that unison systems are useful in designing multiphase systems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Net level aggregation using nonlinear optimization for the solution of hierarchical generalized stochastic Petri nets

    Publication Year: 1992, Page(s):367 - 374
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (600 KB)

    An approach to the hierarchical evaluation of large generalized stochastic Petri net performance models of computer and communication systems is presented. In this method, complex submodels are replaced by substitute nets of lower complexity which bear the same delay time distribution of tokens. An optimum substitute net is found, using nonlinear optimization and matching the delay time distributi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of disk arrays in transaction processing environments

    Publication Year: 1992, Page(s):302 - 309
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (724 KB)

    Analytical models for evaluating the performance of arrayed disk subsystems in normal, degraded, and rebuild mode are developed. Models for estimating rebuild time under the assumption that user requests get priority and can preempt rebuild activity are also developed. It is found that uncached disk arrays perform much worse than uncached nonarrays. It is determined that caches are necessary in ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On deriving distributed programs from formal specifications of functional requirements and architectural constraints

    Publication Year: 1992, Page(s):494 - 501
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (800 KB)

    A method for formal derivation of distributed programs is presented. The approach uses programwide assertions to formulate safety and progress properties of computations. Assertions are used to state functional requirements of the program as well as structural and behavioral constraints imposed by the choice of underlying architecture. The significance of this latter feature is that it offers a si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive routing in mesh-connected networks

    Publication Year: 1992, Page(s):12 - 19
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (640 KB)

    It is shown that wormhole routing in mesh-connected networks can be deadlock free and adaptive without the addition of channels to the basic topology. Several partially adaptive routing algorithms for 2-D and 3-D meshes are described and simulated for a variety of conditions. Simulations of policies for selecting input channels show that transmitting extra information in the header flits can reduc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting iteration-level parallelism in dataflow programs

    Publication Year: 1992, Page(s):376 - 381
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (524 KB)

    An approach to extracting iteration-level parallelism from dataflow programs is presented. The method exploits the single-assignment principle, which guarantees that any data value has exactly one producer. To minimize interprocessor communication, the code is modified so that, at run time, each producer executes on the processor that holds the corresponding data. Overhead resulting from possibly ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A user-oriented synthetic workload generator

    Publication Year: 1992, Page(s):270 - 277
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (628 KB)

    A user-oriented synthetic workload generator that simulates user file access behavior on the basis of real workload characterizations is described. The workload generator is designed for experiments and simulations related to file system analysis. The model for this workload generator is user-oriented and job-specific, represents file I/O operations at the system call level, allows general distrib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data base recovery in shared disks and client-server architectures

    Publication Year: 1992, Page(s):310 - 317
    Cited by:  Papers (3)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (788 KB)

    Solutions to the problem of performing recovery correctly in shared-disks (SD) and client-server (CS) architectures are presented. In SD, all the disks containing the data bases are shared among multiple instances of the database management system (DBMS). In CS, the server manages the disk version of the data base. The clients, after obtaining database pages from the server, cache them in their bu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An architecture of a threaded many-to-many remote procedure call

    Publication Year: 1992, Page(s):504 - 511
    Cited by:  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (672 KB)

    The client-agent-server architecture, which serves as a flexible mechanism for many-to-many remote procedure calls, is discussed. The architecture provides a transparent view of the server to a client. The client accesses the server group through the agent while retaining only an abstract view of the server. The call primitives for the client, agent groups, hook construction and primitives (hooks ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decentralized deadlock-free concurrency control method for multidatabase transactions

    Publication Year: 1992, Page(s):72 - 79
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (652 KB)

    A global concurrency control mechanism for multidatabase systems that preserves the autonomy of local databases and is free from global deadlocks is presented. The mechanism extends the notion of timestamps to a multidatabase environment to enforce the global serialization order through additional data operations on a data item stored in local systems. The main advantage of the mechanism is that i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication structures and paradigms for distributed conferencing applications

    Publication Year: 1992, Page(s):598 - 605
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (788 KB)

    Communication paradigms and structures for workstation software supporting distributed conferencing applications is discussed. The communication system supports an abstraction of event clusters in which the various events generated by an application activity are bundled into one composite event. The communication and synchronization requirements for implementing the event cluster framework are ide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling directed task graphs on multiprocessors using simulated annealing

    Publication Year: 1992, Page(s):20 - 27
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (636 KB)

    Two algorithms based on simulated annealing for minimizing the schedule length of a directed task graph on a multiprocessor system are presented. The first algorithm uses the schedule length itself as the cost function to be minimized. The second algorithm uses an indirect cost function that minimizes the total communication overhead and the total loss of parallelism simultaneously. Implementation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TQL: a tasking query language for concurrent program analysis

    Publication Year: 1992, Page(s):382 - 389
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (668 KB)

    A tasking query language (TQL) for aiding very general analysis of Ada tasking in a Petri-net-based environment is discussed. An important principle of TQL's design is that of hiding the formalism upon which the analysis framework is built. Instead, TQL defines a language by which queries of Ada interactions themselves can be expressed. Examples of TQL's capabilities are presented, and a sample an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing protocol converters from service specifications

    Publication Year: 1992, Page(s):344 - 351
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (656 KB)

    A four-step algorithm for constructing a protocol converter using the top-down approach is proposed. The algorithm involves construction of a system graph from the required service specification and the service specifications of the target protocols; construction of a service converter and new protocols services from the constructed system graph modification of the given protocols entities, to sup... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance prediction modeling of multicomputers

    Publication Year: 1992, Page(s):278 - 285
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (616 KB)

    An efficient execution model for tree structured computations is presented. A general framework for analyzing the performance of this type of computation for any given topology is discussed. The framework is used to derive models for two widely used parallel programming strategies: processor farms and divide and conquer. The models were validated on a large multicomputer, and it was shown that the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RAID organization and performance

    Publication Year: 1992, Page(s):318 - 325
    Cited by:  Papers (17)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (616 KB)

    A disk array architecture that generalizes the RAID (redundant arrays of inexpensive disks) level V data organization while providing excellent storage utilization, response times, and fault tolerance is discussed. A key feature of the approach is that reliability groups can contain several check data disks beyond the single parity disk. RAID response times for fault-free and failure recovery oper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond micro-kernel design: decoupling modularity and protection in Lipto

    Publication Year: 1992, Page(s):512 - 520
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (840 KB)

    It is argued that a modular operating system architecture should provide support for modularity independent of protection domains. Given such support, modules and interfaces can be designed according to sound software engineering principles, without concern for cross-domain invocation costs. The partitioning of modules into domains and across machines becomes a matter of configuration, rather than... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed, scalable, and static parallel arc consistency algorithms on private memory machines

    Publication Year: 1992, Page(s):442 - 449
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (628 KB)

    Several arc consistency algorithms for sequential and parallel processing computers are reviewed. Three distributed parallel arc consistency algorithms-DSPAC-1, DSPAC-2, and DSPAC-3-are introduced and compared with existing algorithms. Through actual machine experimentation the time required for the DSPAC algorithms was measured and compared with that for existing sequential algorithms. Results in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient protocol for voting in distributed systems

    Publication Year: 1992, Page(s):640 - 647
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (584 KB)

    A voting protocol that can reduce the communication costs in distributed systems significantly is proposed. The technique arranges nodes in small intersecting groups, such that a site, in absence of failures, needs to communicate only with members of its group to collect the quorum. A method for constructing such logical groups is presented. It is shown that the message overhead of any operation i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An all-sharing load balancing protocol in distributed systems on the CSMA/CD local area network

    Publication Year: 1992, Page(s):82 - 89
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (680 KB)

    A protocol for dynamic load balancing in distributed systems on the CSMA/CD local area network is presented. Using the protocol, the workload is evenly distributed throughout the system when load-balancing activity is triggered, and effective load distribution is accomplished through transmission of load-balancing messages in a collision-free manner. Analytical and simulation results are presented... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the reliability of name resolution mechanism in distributed operating systems

    Publication Year: 1992, Page(s):589 - 596
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (668 KB)

    A way to improve the reliability of the name resolution mechanism in distributed operating systems is proposed. It is shown that the name resolution mechanism can be made highly reliable by achieving a high degree of reliability of the name resolution operation for a limited number of pairs. To take care of the changing reliability needs of a particular user for different objects with the passage ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multitasking in multistage interconnection network machines

    Publication Year: 1992, Page(s):30 - 37
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (596 KB)

    Cubic and noncubic task allocation algorithms for multistage-interconnection-network (MIN)-based multiprocessors are presented. Conflicts in passage through the network and inability to partition the system effectively are the main bottlenecks in a MIN-based system. To solve both problems, a renaming scheme called bit reversal (BR) matching pattern is proposed. This matching pattern minimizes conf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed cooperative control for sharing applications based on multiparty and multimedia desktop conferencing system: MERMAID

    Publication Year: 1992, Page(s):538 - 546
    Cited by:  Patents (36)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (932 KB)

    A control scheme for sharing applications that is based on MERMAID, a distributed multiparty desktop conferencing system, is described. The control scheme design is based on a replicated architecture which runs a copy of the application at every site or workstation. It is shown that the approach is applicable to developing shared applications, with slight application-independent modifications, to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient data interface for heterogeneous distributed environments

    Publication Year: 1992, Page(s):390 - 397
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (716 KB)

    A multi-language-based data interface system for heterogeneous distributed processing is introduced. A prototyped environment based on this system is discussed, and an evaluation of the prototyped system is presented. It is shown that by keeping the syntax of the specification language flexible and close to existing high-level languages, a user can learn the interface language quickly. Semanticall... View full abstract»

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