Scheduled System Maintenance
On Tuesday, January 23, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

Proceedings.,10th International Conference on Distributed Computing Systems

May 28 1990-June 1 1990

Filter Results

Displaying Results 1 - 25 of 70
  • Proceedings. The 10th International Conference on Distributed Computing Systems (Cat. No.90CH2878-7)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (25 KB)
    Freely Available from IEEE
  • A constructive approach to the design of distributed systems

    Publication Year: 1990, Page(s):580 - 587
    Cited by:  Papers (29)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    A constructive design approach to distributed systems is described. The approach is illustrated by a model airport shuttle system, which is implemented in an environment for distributed programming called Conic. The main principles on which the constructive approach is based are those of explicit system structure and context-independent components. Structure is explicitly described and preserved d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the relative execution times of distributed protocols

    Publication Year: 1990, Page(s):80 - 87
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    A formalism for comparing the average execution time of distributed protocols is provided. The comparisons are made independently of the properties of the network on which the protocols are executed. The formalism takes into account computation time, the time to transfer information, the time spent by a site waiting to synchronize with other sites, and the overlap among them. A framework in which ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traffic routing for multi-computer networks with virtual cut-through capability

    Publication Year: 1990, Page(s):398 - 405
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The problem of selecting routes for interprocess communication in a network with virtual cut-through capability, while balancing the network load and minimizing the number of times that a message gets buffered, is addressed. The approach taken is to formulate the route selection problem as a minimization problem, with a link cost function that depends on the traffic through the link. The form of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • History, an intelligent load sharing filter

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

    The author proposes a filter component to be included in a load-sharing algorithm to detect short-lived jobs not worth considering for remote execution. Three filters are presented. One filter, called History, detects short-lived jobs by using job names and statistics based on previous executions. Job traces are allocated from diskless work stations connected by a local area network and supported ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Hartstone: a distributed real-time benchmark suite

    Publication Year: 1990, Page(s):70 - 77
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    An extension of the uniprocessor Hartstone benchmark for the distributed real-time environment, called the Distributed Hartstone benchmark, is described. The Distributed Hartstone measures system performance in the critical areas of communication latency and bandwidth, protocol preemptability, and priority queueing at the protocol and media access levels. Areas of the system which are particularly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing fault-tolerant distributed applications using objects and multi-coloured actions

    Publication Year: 1990, Page(s):203 - 210
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    The authors develop some control structures suitable for composing fault-tolerant distributed applications using atomic actions (atomic transactions) as building blocks. The authors describe how such structures may be implemented using the concept of multicolored actions. The reasons why other control structures, in addition to nested and concurrent atomic actions, are desirable and are identified... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rate-based congestion avoidance and control scheme for packet switched networks

    Publication Year: 1990, Page(s):390 - 397
    Cited by:  Papers (6)  |  Patents (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    A congestion avoidance and control scheme that monitors the incoming traffic to each destination and provides rate-based feedback information to the sources of bursty traffic so that sources of traffic can adjust their packet rates to match the network capacity is described. The congestion avoidance mechanism at nodes on the periphery of the network controls incoming traffic so that it does not ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal routing in the de Bruijn networks

    Publication Year: 1990, Page(s):537 - 544
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    The problem of optimal routing in an interconnection network, called the de Bruijn network, where the sites are linked in the form of a de Bruijn graph, is considered. The distance functions for both the undirected and directed de Bruijn graphs are provided. The optimal routing problem is then reduced to that of pattern matching. Morris and Pratt's (1970) failure function and Weiner's (1973) prefi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model of the F18 mission computer software for pre-run-time scheduling

    Publication Year: 1990, Page(s):62 - 69
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    The development of pre-run-time schedulers for certain hard real-time applications is investigated. This scheduling scheme requires the modeling of the program as a set of processes with corresponding timing specifications, such as release times, computation times, and deadlines. The models must specify precedence and exclusion constraints between pairs of processes. It is processed by an offline ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional voting: a general method for implementing synchronization in distributed systems

    Publication Year: 1990, Page(s):362 - 369
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    A concept called multidimensional voting, in which the vote and quorum assignments are k-dimensional vectors of nonnegative integers and each dimension is independent of the others, is introduced. Multidimensional voting is more powerful than traditional weighted voting because it is equivalent to the general method for achieving synchronization in distributed systems which is based on co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of the backtrack-to-the-origin-and retry routing for hypercycle-based interconnection networks

    Publication Year: 1990, Page(s):278 - 284
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    Hypercycles, a class of multidimensional graphs that are generalizations of the n-cube are presented. These graphs are obtained by allowing each dimension to incorporate more than two elements and a cyclic interconnection strategy. Hypercycles offer simple routing and the ability, given a fixed degree, to choose among a number of different size graphs. These graphs can be used in the desi... View full abstract»

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

    Publication Year: 1990, Page(s):134 - 141
    Cited by:  Papers (41)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The authors define a causal distributed breakpoint, which is initiated by a sequential breakpoint in one process of a distributed computation and restores each process in the computation to its earliest state that reflects all events that happened before the breakpoint. An algorithm for finding the causal distributed breakpoint, given a sequential breakpoint in one of the processes, is presented. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comprehensive-based database language and its distributed execution

    Publication Year: 1990, Page(s):442 - 449
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    The authors describe a way of noticeably reducing the description cost of database operations executed in distributed computing environments through the design of a declarative language to describe database operations, the development of program transformation techniques to improve efficiency at execution time, and the clarification of prerequisites to execute the programs in distributed computing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two adaptive location policies for global scheduling algorithms

    Publication Year: 1990, Page(s):502 - 509
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Two location policies that, by adapting to the system load, capture the advantages of receiver-initiated, sender-initiated, and symmetrically initiated algorithms are presented. A key feature of these location policies is that they are general and can be used in conjunction with a broad range of existing transfer policies. By means of simulation, two representative algorithms making use of these a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low cost comparisons of file copies

    Publication Year: 1990, Page(s):196 - 202
    Cited by:  Papers (14)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    The author present a file comparison scheme in which the signatures of individual pages are compared by means of a supersignature calculated from the individual page signature. A supersignature is obtained as a power series in a primitive root within the Galois field with 2n elements. The coefficients are the signatures of the individual pages. With this scheme errors, such as missing, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overview of disaster recovery for transaction processing systems

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

    An overview is given of the major issues involved in maintaining an up-to-date backup copy of a database, kept at a remote site. A method is presented for performing this task without impairing the performance at the primary site. The method is scalable, and it is particularly suitable for multiprocessor systems. The mechanism is relatively straightforward and can be implemented using well-known c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal static load balancing of multi-class jobs in a distributed computer system

    Publication Year: 1990, Page(s):562 - 569
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    This model is an extension of the Tantawi and Towsley (1985) single-job-class model as applied to a multiple-job-class model. Some properties of the optimal solution are shown. On the basis of these properties, a straightforward and efficient algorithm for optimal load balancing of multiclass jobs is derived. The performance of this algorithm is compared with that of two other well-known algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of a hierarchical quorum consensus algorithm for replicated objects

    Publication Year: 1990, Page(s):378 - 385
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    A class of algorithms for synchronizing a large number of identical copies of an object is described, and its performance is evaluated. The method is based on organizing a group of objects into a multilevel hierarchy and extending the quorum consensus algorithm to such an environment. The performance of the algorithm is compared, in terms of availability and message cost, with that of two other me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study of communication resource allocation in a distributed system

    Publication Year: 1990, Page(s):530 - 536
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    The authors introduce two techniques for allocating and managing buffers in support of distributed system operation and evaluate the resulting system behavior. For this evaluation a methodology that permits the development of an analytic model is introduced. With the help of this model, it becomes possible to fine-tune the buffer allocation policies in realistic system configurations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On fairness as an abstraction for the design of distributed systems

    Publication Year: 1990, Page(s):150 - 157
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    A fairness property, called U-fairness, is studied in the context of the design of distributed systems with multiparty interactions. This is done with an overlapping model of concurrency. A distributed algorithm implementing the fairness notion is presented. U-fairness is shown to be more appropriate to the design of distributed systems than other known fairness notions because it provides an abst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application-level programming

    Publication Year: 1990, Page(s):458 - 465
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    The use of a declarative language, called Dura, designed to support application-level programming is illustrated by distributed avionics system. The authors show how the language is used to describe the application, its components and structure; how the run-time executive provides support for fault-tolerance by reconfiguration of the application; and how an interactive interface to the executive s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Slow memory: weakening consistency to enhance concurrency in distributed shared memories

    Publication Year: 1990, Page(s):302 - 309
    Cited by:  Papers (32)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    The use of weakly consistent memories in distributed shared memory systems to combat unacceptable network delay and to allow such systems to scale is proposed. Proposed memory correctness conditions are surveyed, and how they are related by a weakness hierarchy is demonstrated. Multiversion and messaging interpretations of memory are introduced as means of systematically exploring the space of pos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending distributed shared memory to heterogeneous environments

    Publication Year: 1990, Page(s):30 - 37
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    The problems of building a distributed shared memory system on a network of heterogeneous machines are discussed. An existing algorithm (due to K. Li, 1986) that implements distributed shared memory is extended to a heterogeneous environment. An implementation that runs on Sun and DEC Firefly multiprocessor workstations connected by Ethernet is described. Related implementation and performance iss... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Support for continuous media in the DASH system

    Publication Year: 1990, Page(s):54 - 61
    Cited by:  Papers (42)  |  Patents (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    The DASH resource model is defined as a basis for reserving and scheduling resources (disk, CPU, network, etc.) involved in end-to-end handling of continuous-media (information flowing continuously over real time i.e. digital audio or digital video) data. The model uses primitives that express work-load characteristics and performance requirements, and defines an algorithm for negotiated reservati... View full abstract»

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