Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

[1988] Proceedings. The 8th International Conference on Distributed

13-17 June 1988

Filter Results

Displaying Results 1 - 25 of 67
  • 8th International Conference on Distributed Computing Systems (Cat. No.88CH2541-1)

    Publication Year: 1988
    Request permission for commercial reuse | PDF file iconPDF (21 KB)
    Freely Available from IEEE
  • The Clouds distributed operating system: functional description, implementation details and related work

    Publication Year: 1988, Page(s):2 - 9
    Cited by:  Papers (25)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (675 KB)

    A description is given of Clouds, an operating system designed to run on a set of general-purpose computers that are connected via a medium-to-high-speed local area network. The structure of Clouds promotes transparency, support for advanced programming paradigms, and integration of resource management, as well as a fair degree of autonomy at each site. The system structuring paradigm chosen for C... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Microeconomic algorithms for load balancing in distributed computer systems

    Publication Year: 1988, Page(s):491 - 499
    Cited by:  Papers (41)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (627 KB)

    A novel approach to allocating and sharing communication and computational resources in a distributed system is described. The approach, which is based on concepts drawn from microeconomics, uses algorithms that are competitive rather than cooperative. The effectiveness of these concepts is demonstrated by describing an economy that improves the performance of a distributed system by implementing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive optimal load balancing in a heterogeneous multiserver system with a central job scheduler

    Publication Year: 1988, Page(s):500 - 508
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    The authors formally state and discuss the response time minimization problem. They show the equivalence of this problem to a weighted least square load balancing problem. They also discuss the correct solution of these problems. Next they describe and analyze a class of server idle time measurements. Finally, a class of adaptive algorithms is presented, and their performance is studied via simula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation dynamic processing of distributed queries

    Publication Year: 1988, Page(s):510 - 519
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    Several issues that arise in processing distributed queries dynamically are investigated. The effect of inaccuracies in estimation on the cost/delay of strategies is considered. Two methods than can be used to decide whether or not to correct a strategy are examined and compared. The problem of aborting operations in process is also examined, i.e. whether operations which are in progress should be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query optimization in distributed logic-oriented object bases

    Publication Year: 1988, Page(s):520 - 527
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (619 KB)

    A logic-oriented object base is defined to be a deductive database based on an object data model. Like conventional databases, logic-orientated object bases can be constructed on top of computer networks in such a way that the distribution of logical and physical components of the system is kept hidden from the users. Objects are organized hierarchically and are retrieved through customized method... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the communication cost of distributed database processing

    Publication Year: 1988, Page(s):528 - 535
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (730 KB)

    Various communication aspects of locally distributed database processing are studied, using some distributed sorting and distributed hash-based join algorithms as examples. The algorithms are implemented on diskless workstations connected by an Ethernet network to simulate a distributed main memory system environment. This experimental testbed is described. Raw communication performance data (i.e.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and performance bounds for concurrent processing

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

    A novel graph-theoretic model for describing the relation between a decomposed algorithm and its execution in a multiprocessor environment is developed. Called ATAMM, the model consists of a set of Petri-net marked graphs that incorporates the general specifications of a data-flow architecture. The model is useful for representing decision-free algorithms having large-grained, computationally comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of degradable multiprocessor system using time scale decomposition of GSPNs

    Publication Year: 1988, Page(s):545 - 553
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    A time-scale decomposition (TSD) algorithm of a class of generalized stochastic Petri net (GSPN) models for performance evaluation of degradable multiprocessor systems is presented. The failure and repair rates in a multiprocessor system are an order of magnitude smaller than the rates of job arrival and completion; therefore, the GSPN models of these systems are decomposed into a hierarchical seq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network disconnection in distributed systems

    Publication Year: 1988, Page(s):554 - 561
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (475 KB)

    A probabilistic measure of network fault-tolerance expressed as the probability of occurrence of a disconnection is proposed. A simple analytical approximation to the disconnection probability is derived and verified using a Monte Carlo simulation. The effects of the disconnection probability on the overall system's reliability are analyzed using a proposed measure of network resilience.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extended token bus protocol for embedded networks

    Publication Year: 1988, Page(s):145 - 152
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    A network environment is considered that can exist in commercial and military products, such as automatic guided vehicles, that use sensors and processors for movement, attack, defense and communication. A bus protocol called IMAP (improved token bus multiaccess protocol) is proposed for these embedded networks. Two modes of operation are defined for the protocol. The normal mode occurs when token... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of multiple bus interconnection networks with hierarchical requesting model

    Publication Year: 1988, Page(s):138 - 144
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    The performance of multiple-bus networks with full bus-memory connection, single bus-memory connection, and partial bus-memory connection are presented. A type of multiple-bus network, called a partial bus network with K classes, is proposed. Under a nonuniform requesting model called a hierarchical requesting model, the performance of the above multiple-bus networks is analyzed. The cost... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architecture and implementation of the access mechanism for a bus-structured multiservice LAN

    Publication Year: 1988, Page(s):132 - 137
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The design and implementation of a high-speed access mechanism for a fiber-optic multiservice LAN is presented. The handling of stream-type and burst-type communications is accomplished through the use of a distributed hybrid switching protocol that uses an asynchronous dynamic time-division-multiplexing technique. The network comprises a write channel in which each network node transmits and a re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of preemptive and non-preemptive load distributing

    Publication Year: 1988, Page(s):123 - 130
    Cited by:  Papers (38)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    The authors consider whether the addition of a migration facility to a distributed scheduler already capable of placement can significantly improve performance. They examine performance over a broad range of workload characteristics and file system structures. They find that while placement alone is capable of large improvement in performance, the addition of migration can achieve considerable add... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding idle machines in a workstation-based distributed system

    Publication Year: 1988, Page(s):112 - 122
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    The design and performance of scheduling facilities for finding idle hosts in a workstation-based distributed system are described. The focus is on the tradeoffs between centralized and decentralized architectures with respect to scalability, fault tolerance, and simplicity of design, as well as several implementation issues of interest when using multicast communication. It is concluded that the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed upcalls: a mechanism for layering asynchronous abstractions

    Publication Year: 1988, Page(s):55 - 62
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    Procedure calls provide a synchronous interface to call downward through successive layers of abstraction, and remote procedure calls allow the layers to reside in different address spaces. A design is given for distributed upcalls, a mechanism for propagating upcalls across address space boundaries. Distributed upcalls provide a natural complement to remote procedure calls, allowing the user to a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic definition of entries and attributes in the directory service

    Publication Year: 1988, Page(s):563 - 568
    Cited by:  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    Mechanisms are specified for achieving integrity controls over entries and attributes within a directory information base to facilitate the dynamic management of directory information. The existence of the commonly understood directory data and architectural models is assumed. Two directory objects, attribute definitions and entry definitions, are described; they specify the structure of classes o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Condor-a hunter of idle workstations

    Publication Year: 1988, Page(s):104 - 111
    Cited by:  Papers (622)  |  Patents (107)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    The design, implementation, and performance of the Condor scheduling system, which operates in a workstation environment, are presented. The system aims to maximize the utilization of workstations with as little interference as possible between the jobs it schedules and the activities of the people who own workstations. It identifies idle workstations and schedules background jobs on them. When th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault tolerant remote procedure call

    Publication Year: 1988, Page(s):48 - 54
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A scheme is presented that makes a remote procedure call (RPC) mechanism fault-tolerant to hardware failures. Fault tolerance is provided by replicating the procedure at a group of nodes, called a cluster. The copies in a cluster are linearly ordered. A call to a procedure is sent to the first copy in the cluster and is propagated internally to all other copies. In the event of failures, the first... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel algorithm for colouring graphs

    Publication Year: 1988, Page(s):326 - 333
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    A simple and effective parallel algorithm to color the nodes of a graph is presented. The algorithm is useful in its own right. It also provides a vehicle to demonstrate the tradeoffs between performance and speed implicit in many parallel algorithms. The algorithm is used when the parallel machine has at least as many processors as there are nodes to color View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of multiprocessing speedup with emphasis on the effect of scheduling methods

    Publication Year: 1988, Page(s):242 - 248
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The speedup issue is reexamined for message-passing multiprocessors and computer networks in which interprocessor communication overhead is considered undesirable but significant. A unified model of speedup ] is developed for analyzing the system in terms of communication overhead, scheduling, and the application algorithm. The model can be used to assess quantitatively the impact on overall syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Critical path analysis for the execution of parallel and distributed programs

    Publication Year: 1988, Page(s):366 - 373
    Cited by:  Papers (38)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    The authors present the design, implementation, and testing of the critical path analysis technique using the IPS performance measurement tool for parallel and distributed programs. They create a precedence graph of a program's activities (program activity graph) with the data collected during the execution of a program. The critical path, the longest path in the program activity graph, represents... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Imbedding gradient estimators in load balancing algorithms

    Publication Year: 1988, Page(s):482 - 490
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    The problem of efficiently determining the optimum threshold parameter values for a decentralized load balancing algorithm is investigated. Simulation is used to study the behavior of a gradient-based decentralized optimization algorithm for obtaining good values. The algorithm computes the incremental job delay as a function of changes in both the local and remote job arrival rate. Estimators for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable broadcast in networks with nonprogrammable servers

    Publication Year: 1988, Page(s):428 - 437
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    The problem of implementing reliable broadcast in ARPA-like computer networks is studied. The environment is characterized by the absence of any multicast facility on the communication by the absence of any multicast facility on the communications subnetwork level. Thus, broadcast has to be implemented directly on hosts. A reliable broadcast protocol is presented and evaluated with respect to seve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic page migration in multiprocessors with distributed global memory

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

    Multiprocessor architectures using point-to point interconnects and executing parallel algorithms require careful partitioning and allocation of data and processes. For a given interconnection, optimal allocation may be difficult to achieve in some cases because the data-dependent behavior of some algorithms may be impossible to predict. A mechanism called the pivot mechanism is introduced and des... View full abstract»

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