[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
  • A unified approach to fault-tolerant routing

    Publication Year: 1992, Page(s):210 - 217
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    A theoretical study of the connectivity and fault tolerance of Cartesian product networks is presented. The theoretical results are used to synthesize provably correct adaptive fault-tolerant algorithms from ones written for the component networks. The theoretical foundations that relate the connectivity of a Cartesian product network, the connectivity of the component networks, and the number of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Process-channelagent-process model of asynchronous distributed communication

    Publication Year: 1992, Page(s):4 - 11
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    A simple model of asynchronous distributed communication, the process-to-channelagent-to-process (PCP) model, is presented. This model is used as a framework for presenting channel grammars that specify channel behavior. The PCP model, in conjunction with channel grammars, provides a versatile and succinct mechanism for specifying and comparing different types of channels, as well as fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconfigurable cube architecture for parallel computation

    Publication Year: 1992, Page(s):218 - 225
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    The construction of a dynamic cube network architecture that extends the capabilities of hypercube architectures with only a small increase in hardware complexity is described. The network is self-routing in the sense that there is a simple distributed routing algorithm which guarantees optimal paths between any pair of the vertices. This, together with other improvements in embedding properties, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation analysis of faults and conflicts in a multicast-connected multi-path cube-based network

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

    The problem of reconfiguration in a multicast-connected fault-tolerant multiple-path multistage interconnection networks (MIN) is discussed. The results of a simulation study conducted to evaluate the performance of the complementary two-stage cube (C2SC) network, a four-path cube-based network, under faults in the multicast mode are presented. The performance index used is the probability of fail... 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.
  • An algorithmic method for protocol conversion

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

    An algorithmic method for constructing protocol converters to achieve interoperability between networks that implement incompatible protocols is presented. The converter constructed using this approach does not cause unspecified receptions or deadlocks if the original protocols are safe. The method is guaranteed to generate a valid converter if one exists for the given protocols, with the conversi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On conformance in the context of open systems

    Publication Year: 1992, Page(s):236 - 243
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Conformance is one of the key notions in the context of open systems and therefore must be precisely defined. Existing formalizations define conformance independently of the environment into which the open system will be embedded. It is argued that it is, in general, not adequate to guarantee conformance in an intuitive sense. Conformance should relate the visible behavior defined by two specifica... 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.
  • An implementation of flush channels based on a verification methodology

    Publication Year: 1992, Page(s):336 - 343
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    Flush channels generalize more conventional asynchronous message passing protocols. A distributed system that uses flush channels allows a programmer the flexibility of specifying the delivery order of each message in relation to other messages transmitted on the channel. An implementation technique that follows directly from a verification methodology for flush channels is presented. A relatively... 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.
  • An adaptive scheduling scheme for dynamic service time allocation on a shared resource

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

    A scheduling scheme that allows a number of customers to share a common resource in an efficient and fair way is presented. Each customer is allowed to use the resource for an amount of time that does not exceed a certain limit, the limit being a function of the waiting time elapsed between the time of its last request and the time of access to the resource. After expiration of the service time al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic characterization of algebraic protocol specifications

    Publication Year: 1992, Page(s):260 - 268
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    A generative model for extending algebraic protocol specifications with probabilities is presented. The approach associates a simple probabilistic characterization with each algebraic operator occurrence in a behavior expression. The result is a compact notation in which the assignment of probabilities is more straightforward than with transition-based models. It is shown that an equivalent state ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Validation and performance evaluation of the partition and replicate algorithm

    Publication Year: 1992, Page(s):400 - 407
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    The partition-and-replicate-strategy (PRS) algorithm for distributed query processing is evaluated and its performance is validated. Although in principle PRS is better than single-site processing, early experimental results indicate the contrary. Based on experimental results, the factor which causes performance deterioration is identified and a remedy is provided. As a result, it is shown that t... 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 (1)  |  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.
  • Scheduling directed task graphs on multiprocessors using simulated annealing

    Publication Year: 1992, Page(s):20 - 27
    Cited by:  Papers (7)
    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.
  • 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.
  • 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.
  • Comet: a toolkit for multiuser audio/video applications

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

    Comet, a UNIX/C++ toolkit for writing programs, such as teleconferencing systems and collaborative editors, that involve multiple users and use digital audio video, is described. Comet provides a simple programming interface: the application builds a graph of objects representing speakers and microphones, mixers, files, etc. Comet realizes the graph by creating and interconnecting processes and au... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed file allocation with consistency constraints

    Publication Year: 1992, Page(s):408 - 415
    Cited by:  Papers (11)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    The resource allocation problem in distributed computing systems that have strict mutual consistency requirements is discussed. A model that incorporates the behavior of consistency control algorithms which ensure that mutual consistency of replicated data is preserved even when communication links of the computer network and/or computers on which the files reside fail is presented. The constraine... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guaranteeing synchronous message deadlines with the timed token protocol

    Publication Year: 1992, Page(s):468 - 475
    Cited by:  Papers (35)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    The problem of guaranteeing synchronous message deadlines in token ring networks in which the timed token medium access control protocol is used is discussed. Synchronous capacity, defined as the maximum time for which a node can transmit its synchronous messages every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time lock-based concurrency control in distributed database systems

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

    In a real-time database system, it is difficult to meet all timing constraints due to the consistency requirements of the underlying database. Real-time database transaction scheduling requires the development of efficient concurrency control protocols that try to maximize the number of transactions satisfying their real-time constraints. Several distributed, lock-based, real-time, concurrency con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to migrate processes in distributed computing systems-a Markov team approach

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

    A process migration mechanism offers a means to exploit the performance reserves present in networks of workstations used as personal computers by allowing migration of processes from overloaded to underused processors. Several distributed operating systems provide such a facility, the benefits of its use depending on the specification of a proper process migration policy. An analytical model, the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Naming and addressing of objects without unique identifiers

    Publication Year: 1992, Page(s):581 - 588
    Cited by:  Papers (4)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The hierarchical naming scheme, a method for naming and addressing shared objects in large-scale distributed computer systems, is described. The scheme constructs global identifications (IDs) and addresses from locally unique ones. The IDs have relative representations that are translated if they are transmitted among naming contexts. This ensures uniqueness of IDs while preserving efficiency and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Type-specific coherence protocols for distributed shared memory

    Publication Year: 1992, Page(s):434 - 441
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    The concept of a structured distributed shared memory in which memory units are objects is introduced. The coherence of object replicas is maintained by type-specific coherence protocols that are based on the semantics of operations on objects. The aim is to reduce message traffic and operation latency in many common situations. The protocols subsume traditional distributed shared memory protocols... View full abstract»

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