By Topic

IEEE Transactions on Software Engineering

Issue 6 • June 1985

Filter Results

Displaying Results 1 - 14 of 14
  • IEEE Transactions on Software Engineering - Table of contents

    Publication Year: 1985, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (377 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1985, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (200 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 1985, Page(s):497 - 501
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3360 KB)

    THE concepts of system reliability–generally defined as the ability of a system to meet its interface specifications-and of system availability–generally defined as the ability of a system to meet its interface specifications within a specified time limit–predate not only that of distributed computing but also that of the electronic computer itself. With the advent of the electro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing Fault-Tolerant Distributed Objects

    Publication Year: 1985, Page(s):502 - 508
    Cited by:  Papers (49)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2856 KB)

    This paper describes a technique for implementing k-resilient objects–distributed objects that remain available, and whose operations are guaranteed to progress to completion, despite up to k site failures. The implementation is derived from the object specification automatically, and does not require any information beyond what would be required for a nonresilient nondistributed implementat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ordering Actions for Visibility

    Publication Year: 1985, Page(s):509 - 519
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3512 KB)

    Several research projects are studying architectures for distributed computing that are founded on the notion of atomic actions operating on objects (instances of abstract data types). Such projects as Clouds at Georgia Tech and Archons at Carnegie-Mellon University are evaluating this approach as the foundation for constructing distributed operating systems. Objects are not new to operating syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Support for Distributed Transactions in the TABS Prototype

    Publication Year: 1985, Page(s):520 - 530
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5112 KB)

    The TABS prototype is an experimental facility that provides operating system-level support for distributed transactions that operate on shared abstract types. The facility is designed to simplify the construction of highly available and reliable distributed applications. This paper describes the TABS system model, the TABS prototype's structure, and certain aspects of its operation. The paper con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple and Efficient Randomized Byzantine Agreement Algorithm

    Publication Year: 1985, Page(s):531 - 539
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3264 KB)

    A new randomized Byzantine agreement algorithm is presented. This algorithm operates in a synchronous system of n processors, at most t of which can fail. The algorithm reaches agreement in 0(t/log n) expected rounds and O(n2tf/log n) expected message bits independent of the distribution of processor failures. This performance is further improved to a constant expected number of rounds and O(n2) m... View full abstract»

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

    Publication Year: 1985, Page(s):539 - 546
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4032 KB)

    A randomized model of distributed computation was recently presented by Rabin [ 81. This model admits a solution to the Byzantine Agreement Problem for systems of n asynchronous processes where no more than t are faulty. The algorithm described by Rabin produces agreement in an expected number of rounds which is a small constant independent of n and t. Using the same model, we present an algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts

    Publication Year: 1985, Page(s):546 - 554
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4648 KB)

    A site broadcasting its local value to all other sites ina fault-prone environment is a fundamental paradigm in constructing reliable distributed systems. Time complexity lower bounds and network connectivity requirements for reliable broadcast protocols in point-to-point communication networks are well known. In this paper, we consider the reliable broadcast problem in distributed systems with br... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Technique for Estimating Performance of Fault-Tolerant Programs

    Publication Year: 1985, Page(s):555 - 563
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2720 KB)

    A technique is presented for estimating the performance of programs written for execution on fail-stop processors. It is based on modeling the program as a discrete-time Markov chain and then using z-transforms to derive a probability distribution for time to completion. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Modeling of Database Recovery Protocols

    Publication Year: 1985, Page(s):564 - 572
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2568 KB)

    The performance modeling described in this paper compares several protocols which ensure that a database can be recovered to a consistent state after a transaction failure or system crash. The contributions of the paper include a collection of simple analytic models, based on Markov processes, for these protocols and some surprising results on the relative performance of the protocols. We consider... View full abstract»

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

    Publication Year: 1985, Page(s): 572
    Request permission for commercial reuse | PDF file iconPDF (1154 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1985, Page(s): 572-a
    Request permission for commercial reuse | PDF file iconPDF (312 KB)
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1985, Page(s): 572
    Request permission for commercial reuse | PDF file iconPDF (286 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Software Engineering is interested in well-defined theoretical results and empirical studies that have potential impact on the construction, analysis, or management of software. The scope of this Transactions ranges from the mechanisms through the development of principles to the application of those principles to specific environments. Specific topic areas include: a) development and maintenance methods and models, e.g., techniques and principles for the specification, design, and implementation of software systems, including notations and process models; b) assessment methods, e.g., software tests and validation, reliability models, test and diagnosis procedures, software redundancy and design for error control, and the measurements and evaluation of various aspects of the process and product; c) software project management, e.g., productivity factors, cost models, schedule and organizational issues, standards; d) tools and environments, e.g., specific tools, integrated tool environments including the associated architectures, databases, and parallel and distributed processing issues; e) system issues, e.g., hardware-software trade-off; and f) state-of-the-art surveys that provide a synthesis and comprehensive review of the historical development of one particular area of interest.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Matthew B. Dwyer
Dept. Computer Science and Engineering
256 Avery Hall
University of Nebraska-Lincoln
Lincoln, NE 68588-0115 USA
tse-eic@computer.org