By Topic

IEEE Transactions on Software Engineering

Issue 4 • Date July 1983

Filter Results

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

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

    Publication Year: 1983, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (296 KB)
    Freely Available from IEEE
  • A Semantic Design Method

    Publication Year: 1983, Page(s):373 - 384
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3408 KB)

    A system design method where the computer system is adapted to user semantics is described. In the method, user semantics are defined as abstract objects using special languages. Both user data semantics and user operations are defined. A translator converts the abstract definitions into internal machine storage representation and machine instructions. Users can then include the defined operations... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software Structure for Display Management Systems

    Publication Year: 1983, Page(s):385 - 394
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3600 KB)

    Display management software usually provides support for: creating displays on a CRT (cathode ray tube) or other output device; handling user inputs from keyboards, light-pens, and other input devices; and communicating with an application program in terms of these outputs and inputs. We propose a design for a family of display management systems which provide device-independent, high-level suppor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Multiple Implementation of Abstract Data Types Within a Computation

    Publication Year: 1983, Page(s):395 - 411
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4576 KB)

    A fundamental step in the software design process is the selection of a refinement (implementation) for a data abstraction. This step traditionally involves investigating the expected performance of a system under different refinements of an abstraction and then selecting a single alternative which minimizes some performance cost metric. In this paper we reformulate this design step to allow diffe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Paradigm for the Design of Parallel Algorithms with Applications

    Publication Year: 1983, Page(s):411 - 415
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3344 KB)

    This paper proposes a model or paradigm for the development of parallel algorithms, gives an example of the proposed paradigm, and displays algorithms developed by application of the technique. The algorithm for the merge of two ordered lists developed through application of this technique is thought to be original. The paradigm proposed is to create composite unit operations which combine data mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Petri Net Models for the Evaluation of Applicative Programs Based on λ-Expressions

    Publication Year: 1983, Page(s):415 - 427
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4872 KB)

    In applicative systems, program design is based on elementary constructs of the form apply function to argument(s), also called applications, which are to be recursively inserted into each other. Program evaluation follows a process of meaning-preserving transformations which systematically distributes argument expressions within function expressions and substitutes applications of primitive funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ESPRESO—A System for Process Control Software Specification

    Publication Year: 1983, Page(s):427 - 436
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4672 KB)

    This paper outlines a specification system for process control software, named ESPRESO, which was developed at the Nuclear Research Center, Karlsruhe, West Germany. ESPRESO is based on some new ideas, which are combined with elements taken from other systems. ESPRESO consists of a set of concepts, a specification language, a tool for the management, evaluation and validation of specifications, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Scheme of Parallel Processing for MIMD Systems

    Publication Year: 1983, Page(s):436 - 445
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4472 KB)

    This paper presents a recognition procedure for parallel tasks in the user program written in a conventional programming language. To establish our program model, it describes the parallelism of the program in tenns of a process flow graph in which the relationships among processes are of predecessors and successors. And finally it presents a parallel processing scheme which realizes automatically... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processes, Tasks, and Monitors: A Comparative Study of Concurrent Programming Primitives

    Publication Year: 1983, Page(s):446 - 462
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4688 KB)

    Three notations for concurrent programming are compared, namely CSP, Ada, and monitors. CSP is an experimental language for exploring structuring concepts in concurrent programming. Ada is a general-purpose language with concurrent programming facilities. Monitors are a construct for managing access by concurrent processes to shared resources. We start by comparing "lower-level" communication, syn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interconnection of Local Computer Networks: Modeling and Optimization Problems

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

    We study problems of optimization of the topology of interconnected local computer networks using random access to a single channel. An approach to modeling of the system by a queueing network is proposed: the analytical solution of the model allows us to obtain global performance measures, which may be used as evaluation criteria in network topology optimization problems. A heuristic is proposed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Causal Model for Analyzing Distributed Concurrency Control Algorithms

    Publication Year: 1983, Page(s):470 - 486
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6192 KB)

    An event order based model for specifying and analyzing concurrency control algorithms for distributed database systems has been presented. An expanded notion of history that includes the database access events as well as synchronization events is used to study the correctness, degree of concurrency, and other aspects of the algorithms such as deadlocks and reliability. The algorithms are mapped i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distribution Design of Logical Database Schemas

    Publication Year: 1983, Page(s):487 - 504
    Cited by:  Papers (43)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6208 KB)

    The optimal distribution of a database schema over a number of sites in a distributed network is considered. The database is modeled in terms of objects (relations or record sets) and links (predefined joins or CODASYL sets). The design is driven by user-supplied information about data distribution. The inputs required by the optimization model are: 1) cardinality and size information about object... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation

    Publication Year: 1983, Page(s):504 - 512
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4376 KB)

    This paper shows that graph traversal techniques have fundamental differences between serial and distributed computations in their behaviors, computational complexities, and effects on the design of graph algorithms. It has three major parts. Section I describes the computational environment for the design and description of distributed graph algorithms in terms of an architectural model for messa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis of FFT Algorithms on Multiprocessor Systems

    Publication Year: 1983, Page(s):512 - 521
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4160 KB)

    A decimation-in-time radix-2 fast Fourier transform (FFT) algorithm is considered here for implementation in multiprocessors with shared bus, multistage interconnection network (MIN), and in mesh connected computers. Results are derived for data allocation, interprocessor communication, approximate computation time, and speedup of an N point FFT on any P available processing elements (PE's). Furth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Control of a Heterogeneous Two-Server Exponential Queueing System

    Publication Year: 1983, Page(s):522 - 526
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3128 KB)

    A dynamic control policy known as "threshold queueing" is defined for scheduling customers from a Poisson source on a set of two exponential servers with dissimilar service rates. The slower server is invoked in response to instantaneous system loading as measured by the length of the queue of waiting customers. In a threshold queueing policy, a specific queue length is identified as a "threshold,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending CSP to Allow Dynamic Resource Management

    Publication Year: 1983, Page(s):527 - 531
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    In his paper "Communicating Sequential Processes," Hoare suggested the use of the input/output construct and Dijkstra's guarded commands for handling the task of communication and synchronization in distributed systems. Hoare's proposal was intended for programming general parallel systems; as a result, little consideration was given by Hoare to the question of how his mechanisms could be utilized... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weighted Processor Sharing-Results for Hyperexponential Servers

    Publication Year: 1983, Page(s):531 - 535
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    In a recent paper by Fayolle, Mitrani, and Iasnogorodski [2], some general multidimensional integral equations were derived in order to solve for the mean response time of each of several classes in a queue whose service discipline was weighted processor sharing. The arrival processes were Poisson. The weighting means that each job within a class k is given an amount of processing proportional to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Case for Non-Two-Phase Locking Protocols that Ensure Atomicity

    Publication Year: 1983, Page(s):535 - 538
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB)

    A transaction is atomic if it can be considered, as far as other transactions are concerned, to be indivisible and instantaneous even in the case of failure. An almost universally accepted way to ensure atomicity is to use a strict two-phase locking protocol with a roll-back scheme for recovery in case of deadlock or failure. In this note, we argue that this method is not the most economical way t... 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: 1983, Page(s): 538
    Request permission for commercial reuse | PDF file iconPDF (131 KB)
    Freely Available from IEEE
  • Advance Program

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

    Publication Year: 1983, Page(s): 538-c
    Request permission for commercial reuse | PDF file iconPDF (272 KB)
    Freely Available from IEEE
  • Advance Announcement... Tutorial Week West83

    Publication Year: 1983, Page(s): 538
    Request permission for commercial reuse | PDF file iconPDF (1638 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