Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

[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 (14)
    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.
  • 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.
  • Breakpoints and halting in distributed programs

    Publication Year: 1988, Page(s):316 - 323
    Cited by:  Papers (38)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Interactive debugging requires that the programmer be able to half a program at interesting points in its execution. The authors define distributed breakpoints and present an algorithm for implementing the detection points and an algorithm for halting a distributed program in a consistent state. Events that can be partially ordered are defined as detectable and form the basis for the breakpoint pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed debugging tools for heterogeneous distributed systems

    Publication Year: 1988, Page(s):308 - 315
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    A description is given of a collection of tools that form an implementation of event-based abstraction (EBBA), a paradigm for high-level debugging of distributed systems. The tools are capable of operating effectively in a heterogeneous environment containing processors of varying design and power. Toolset users construct libraries of behavior models and observe the behavior of the system through ... View full abstract»

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

    Publication Year: 1988, Page(s):439 - 446
    Cited by:  Papers (30)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The design and implementation of a reliable group communication mechanism is presented. The mechanism guarantees a form of atomicity in that the messages are received by all operational members of the group or by none of them. Since the overhead in enforcing the order of messages is nontrivial, the mechanism provides two types of message transmission: one guarantees delivery of the messages in 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.
  • Bridge: a high performance file system for parallel processors

    Publication Year: 1988, Page(s):154 - 161
    Cited by:  Papers (22)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    A parallel file system called Bridge that distributes each file across multiple storage devices and processors has been designed and prototyped. The approach is based on the notion of an interleaved file, in which consecutive logical blocks are assigned to different physical nodes. Naive programs are able to access files just as they would with a conventional file system, while more sophisticated ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general approach to recognizing event occurrences in distributed computations

    Publication Year: 1988, Page(s):300 - 307
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    A generalized approach to the task of monitoring a distributed computation for event occurrences is presented that involves analyzing the characteristics of both the behavior to be recognized and the environment in which it can occur. The monotonicity of an event, which is a measurement of the stableness of its state, is the primary feature used in characterizing events. A general classification s... 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 (5)  |  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.
  • 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.
  • Data reorganization in a dynamically reconfigurable environment

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

    The authors consider data reorganization in a dynamically reconfigurable distributed database system. The network environment they study is a dynamic system prototype called Driftwood. They present reallocation strategies corresponding to different network reconfiguration and then address the nonblocking reorganization approach. They cover the implementation strategies, impact on user transaction ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient deadlock resolution for lock-based concurrency control schemes

    Publication Year: 1988, Page(s):224 - 233
    Cited by:  Papers (4)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    A distributed algorithm is proposed for detection and resolution of resource deadlocks in object-oriented distributed systems. The algorithm can be used in conjunction with concurrency control algorithms that are based on the semantic lock model. To drastically reduce message traffic, the algorithm properly identifies and eliminates redundant messages. It is shown that its worst and average time c... 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 considerations for distributing services-a case study: mass storage

    Publication Year: 1988, Page(s):289 - 297
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    The partitioning of operating system services in a distributed system and its impact on performance are discussed. An examination is made of the tradeoff between partitioning a service at a higher layer, which could potentially result in greater computation at the server, and partitioning at a lower layer, which could result in less service-related computation at the server but may require more co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduled and nonscheduled access in a distributed system based upon a functional communication model

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

    Request-response communication is studied in the framework of the functional communication model. A scheme that uses the channel access algorithm for distributed scheduling is investigated. A timed token protocol is used to control the two access modes, the scheduled access, with communication initiated by a server, and the nonscheduled access when a client sends a request to a functional group wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining consistency in distributed software engineering environments

    Publication Year: 1988, Page(s):418 - 425
    Cited by:  Papers (5)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The authors argue that immutability is a suitable base on which to build distributed software engineering environments. They discuss the various approaches to maintaining consistency in immutable object systems and compare D.P. Reed's model of time domain addressing (ACM Trans. Comput. Syst., vol.1, no.1, p.3-23, Feb. 1983), with their own model of domain relative addressing. They demonstrate the ... View full abstract»

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