By Topic

[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
  • Synchronization and concurrency measures for distributed computations

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

    Several qualitative measures that quantify the degree of concurrency in a distributed computation are presented. The measures characterize the synchronization constraints inherent in a distributed computation and are independent of the underlying system running the computation. The measures are defined by two well defined abstractions, called cone and cylinder, to which simple measures can be asso... 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 (4)
    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.
  • A distributed Lisp programming system: implementation and usage

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

    The implementation details of a Lisp environment built on top of a distributed operating system are presented. The system provides transparent distribution, protected large-grain persistent heaps, concurrency within each environment and seamless sharing of Lisp data structures between separate environments 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.
  • Performance analysis of hierarchical task queue organization for parallel systems

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

    A hierarchical task queue organization that avoids the task queue bottleneck associated with the centralized organization and provides performance better than centralized and distributed organizations is proposed. A detailed performance analysis shows that the hierarchical organization is less sensitive to parameters like the branching factor and transfer factor. Therefore, it is suitable for larg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TrActorS: a transactional actor system for distributed query processing

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

    A transaction management model for distributed information systems that utilizes actor-like objects (TrActor) which deviate from conventional actors in their objects types, messages types, and mail queue is described. The objects are used in conjunction with distributed blackboarding techniques for addressing the process of reasoning about the need for cooperation and negotiation between the dispa... 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.
  • 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 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.
  • An epistemic logic based synthesis of communication services and protocols

    Publication Year: 1992, Page(s):674 - 681
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    The advantages of an initial specification based on the knowledge properties of the service users and service providers for specifying the communication mechanisms of a layer is discussed. This particular way of proceeding with specification causes the designer to express pertinent high level properties that enable the designer to rationally infer a complete specification of the mechanistic attrib... 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.
  • An analysis of the join the shortest queue (JSQ) policy

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

    An analytical method is developed to analyze the performance of the join the shortest queue (JSQ) policy for systems with N identical queues, N⩾2. No simulation result is used to refine the analytical model. A birth-death Markov process is used to model the evolution of the total number of jobs in the system. An iterative procedure is developed to estimate the average service... 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.
  • Delegation through access control programs

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

    Access control programs (ACPs), which permit controlled delegation of access rights to untrusted computer hosts, are discussed. Existing delegation protocols for distributed systems provide a way for a client to transfer its access rights to an intermediary, but provide only limited facilities for restricting the rights granted to the intermediary. ACPs are small programs that encode arbitrary spe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal analysis of waiting times for distributed real-time processes

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

    An approach to automated timing analysis of distributed real-time programs is presented. The method is based on the static analysis of the task system and generation of global operation (GO) paths for which the timing analysis is applied. It is shown that a closed form solution algorithm is NP-complete. In order to more efficiently determine maximum waiting times for tasks sharing resources, even ... 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.
  • 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 new communication tool: time dependent multimedia document

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

    Time dependent multimedia document (TDMD), a tool that supports human communication under distributed computing environments, is described. TDMD supports various types of communication media, including audio, video, text, graphics, and image. Multimedia presentation is formally defined, and it is shown that, TDMD can be represented uniquely as a tree structure. In the structure, hyperlink informat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a finite projective plane with a duality for decentralized consensus protocols

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

    An efficient communication structure based on a finite projective plane with a duality is presented. The communication structure halves the number messages required in two rounds as compared to a communication structure based on a finite projective plane. It is shown that a finite projective plane with a duality can be constructed from a difference set, and that the communication structure present... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication-oriented assignment of task modules in hypercubic multicomputers

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

    The problem of mapping a task that is composed of interacting modules onto a hypercube multicomputer is formulated and solved by minimizing an objective function called the communication traffic. The objective function allows module assignments to be found with the usual straightforward combinatorial optimization techniques. The problem of finding an assignment that minimizes the communication tra... 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.
  • 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.
  • 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.
  • Efficient decentralized consensus protocols in a distributed computing system

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

    Two classes of efficient decentralized consensus protocols for a distributed computing system consisting of an arbitrary number of nodes, one without an initiator and the other with an initiator, are described. It is shown that the protocol without an initiator can be systematically executed and completed in the minimal number of steps. The protocol with an initiator is divided into three phases: ... View full abstract»

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