By Topic

Software Engineering, IEEE Transactions on

Issue 5 • Date May 1985

Filter Results

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

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (329 KB)  
    Freely Available from IEEE
  • IEEE Computer Society

    Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (200 KB)  
    Freely Available from IEEE
  • Editorial

    Page(s): 445
    Save to Project icon | Request Permissions | PDF file iconPDF (120 KB)  
    Freely Available from IEEE
  • A Loosely Coupled Distributed System for Reliably Storing Data

    Page(s): 446 - 454
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2040 KB)  

    An algorithm for storing information redundantly on the nodes of a broadcast network is proposed. A voting technique is used to increase reliability. Since multiple votes are cast only when copies of a data item disagree, the algorithm has the property that communication overhead is minimal. In addition, nodes storing erroneous copies are automatically resynchronized. A Markov analysis is performed which relates parameters of the algorithm to the mean time to failure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completeness of Proof Systems for Equational Specifications

    Page(s): 454 - 461
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2984 KB)  

    Contrary to popular belief, equational logic with induction is not complete for initial models of equational specifications. Indeed, under some regimes (the Clear specification language and most other algebraic specification languages) no proof system exists which is complete even with respect to ground equations. A collection of known results is presented along with some new observations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Atomic Actions and Resource Coordination Problems Having Nonunique Solutions

    Page(s): 461 - 471
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3672 KB)  

    The concept of atomic actions is decomposed into database-dependent atomic actions and application-dependent atomic actions. There is a broad class of application-dependent atomic actions that can have nonunique solutions. These are resource coordination problems and are classified as problems of NU class. It is argued that a transaction modeling a problem of NU class provides lower concurrency. A concept of coordination is proposed which can model a broad range of NU class problems. An object model and a protocol are sugested which utilize the nonunique character of the solution to provide higher concurrency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Compiler for an Array and Vector Processing Language

    Page(s): 471 - 478
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2736 KB)  

    A compiler for a Pascal-based language Actus is described. The language is suitable for the expression of the type of parallelism offered by both array and vector processors. The implementation described is for the Cray-1 computer. An objective of the implementation has been to construct an optimizing compiler which can be readily adapted for a range of array and vector processors. As a result the machine-dependent sections of the compiler have been clearly identified. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical Estimation of Software Reliability

    Page(s): 479 - 483
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (952 KB)  

    When a new computer software package is developed, a testing procedure is often put into effect to eliminate the faults, or bugs, in the package. One common procedure is to try the package on a set of well-known problems to try to see if any errors result. This goes for some fixed time with all detected errors being noted. Then the testing stops and the package is carefully checked to determine the specific bugs that were responsible for the observed errors, and the package is then altered to remove these bugs. A problem of great importance is the estimation of the error rate of this revised software package. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Availability Model for Distributed Transaction Systems

    Page(s): 483 - 491
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1888 KB)  

    A method is proposed for quantitatively evaluating the availability of a distributed transaction system (DTS). The DTS dynamics can be modeled as a Markov process. The problem of formulating the set of linear homogeneous equations is considered, obtaining the related coefficient matrix, that is, the transition rate matrices of the DTS elements. Such operations can be performed according to the rules of Kronecker algebra. The transition rate matrices are used to calculate the probabilities of the different possible states of the DTS. The availability with respect to a transaction T is computed through its representation by means of a structure graph and a structure vector related to the probabilistic state of the DTS element relevant to the transaction T itself. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Load Balancing in a Multiple Processor System with Many Job Classes

    Page(s): 491 - 496
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1480 KB)  

    A loosely coupled multiprocessor system contains multiple processors which have their own local memories. To balance the load among multiple processors is of fundamental importance in enhancing the performance of such a multiple processor system. Probabilistic load balancing in a heterogeneous multiple processor system with many job classes is considered in this study. The load balancing scheme is formulated as a nonlinear programming problem with linear constraints. An optimal probabilistic load balancing algorithm is proposed to solve this nonlinear programming problem. The proposed load balancing method is proven globally optimum in the sense that it results in a minimum overall average job response time on a probabilistic basis. View full abstract»

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

    Page(s): 496
    Save to Project icon | Request Permissions | PDF file iconPDF (196 KB)  
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Page(s): 496-a
    Save to Project icon | Request Permissions | PDF file iconPDF (240 KB)  
    Freely Available from IEEE
  • Beyond the Basics: A Software Publication Series for Successful Computer Professionals From the IEEE Computer Society

    Page(s): 496-b
    Save to Project icon | Request Permissions | PDF file iconPDF (1096 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
tseeicdwyer@computer.org