By Topic

IEEE Transactions on Software Engineering

Issue 10 • Oct. 1985

Filter Results

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

    Publication Year: 1985, Page(s):c1 - 1252
    Request permission for commercial reuse | PDF file iconPDF (762 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
  • Editorial

    Publication Year: 1985, Page(s): 993
    Request permission for commercial reuse | PDF file iconPDF (184 KB)
    Freely Available from IEEE
  • Software Science Applied to APL

    Publication Year: 1985, Page(s):994 - 1000
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2448 KB)

    Previous attempts to apply Halstead's software metrics to APL have led to inconsistent and counter-intuitive results. This work is a further investigation into the application of software metrics to APL to try to resolve some of the inconsistency. The effect of variations in the counting rules on values calculated for the software metrics was studied. These rules were used to analyze a set of prog... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Allocating Independent Subtasks on Parallel Processors

    Publication Year: 1985, Page(s):1001 - 1016
    Cited by:  Papers (144)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3432 KB)

    When using MIMD (multiple instruction, multiple data) parallel computers, one is often confronted with solving a task composed of many independent subtasks where it is necessary to synchronize the processors after all the subtasks have been completed. This paper studies how the subtasks should be allocated to the processors in order to minimize the expected time it takes to finish all the subtasks... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interfacing UNIX to Data Communications Networks

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

    We propose an interface for use from within UNIX1 user programs for communicating over multiple and varied local and wide area networks. This interface aids the design of a distributed application program by hiding the actual communications protocols used over each network, and providing instead simple primitives for sending and receiving (possibly large) datagrams, using a simple standardized net... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstract Data Type Development and Implementation: An Example

    Publication Year: 1985, Page(s):1033 - 1037
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB)

    Data abstraction is an effective tool in the design of complex systems, and the representation independence it provides is a key factor in the maintenance and adaptation of software systems. This paper describes a system development methodology based on the development of hierarchies of abstract data types (ADT's). The methodology preserves a high degree of representation independence throughout b... View full abstract»

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

    Publication Year: 1985, Page(s):1038 - 1039
    Request permission for commercial reuse | PDF file iconPDF (1360 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical and Scientific Database Issues

    Publication Year: 1985, Page(s):1040 - 1047
    Cited by:  Papers (15)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3264 KB)

    The purpose of this paper is to summarize the research issues of statistical and scientific databases (SSDB's). It organizes the issues into four major groups: physical organization and access methods, operators, logical organization and user interfaces, and miscellaneous issues. It emphasizes the differences between SSDB's and traditional database applications, and motivates the need for new and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Compression in Scientific and Statistical Databases

    Publication Year: 1985, Page(s):1047 - 1058
    Cited by:  Papers (42)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5352 KB)

    Scientific and statistical database systems heavily depend on data compression techniques to make possible the management and storage of their large databases. The efficiency of data compression methods has a signficant impact on the overall performance of these systems. The purpose of this paper is to show the importance of data compression to scientific/statistical databases, to discuss the pros... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Support of Statistical Operations

    Publication Year: 1985, Page(s):1058 - 1070
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5520 KB)

    Most research in statistical databases has concentrated on retrieval, sampling, and aggregation type statistical queries. Data management issues associated with computational statistical operations have been ignored. As a first step towards integrating database management support of statistical operations, we have analyzed the performance of X'X, the QR decomposition, and the Singular Value Factor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical Database Query Languages

    Publication Year: 1985, Page(s):1071 - 1081
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4048 KB)

    Databases that are mainly used for statistical analysis are called statistical databases (SDB). A statistical database management system (SDBMS) may be defined as a database management system that provides capabilities 1) to model, store, and manipulate data in a manner suitable for the needs of SDB users, and 2) to apply statistical data analysis techniques that range from simple summary statisti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Antisampling for Estimation: An Overview

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

    We survey a new way to get quick estimates of the values of simple statistks (like count, mean, standard deviation, maximum, median, and mode frequency) on a large data set. This approach is a comprehensive attempt (apparently the first) to estimate statistics without any sampling. Our "antisampling" techniques have analogies to those of sampling, and exhibit similar estimation accuracy, but can b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Foreword Advances in Distributed Computing Systems

    Publication Year: 1985, Page(s):1092 - 1096
    Request permission for commercial reuse | PDF file iconPDF (2392 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimal Algorithm for Processing Distributed Star Queries

    Publication Year: 1985, Page(s):1097 - 1107
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4616 KB)

    The problem of optimal query processing in distributed database systems was shown to be NP-hard. However, for a special type of queries called star queries, we have developed a polynomial optimal algorithm. Semijoin tactics are applied for query processing. An execution graph is introduced to represent the semijoin programs associated with the distributed processing of the queries. We then identif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent Broadcast for Information Dissemination

    Publication Year: 1985, Page(s):1107 - 1112
    Cited by:  Papers (6)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4136 KB)

    Concurrent broadcast involves the dissemination of a database, consisting of messages initially distributed among the nodes of a network, so that a copy of the entire database eventually resides at each node. One application is the dissemination of network status information for adaptive routing in a communications network. This paper examines the time complexity and communication complexity of se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling of Software Partition for Distributed Real-Time Applications

    Publication Year: 1985, Page(s):1113 - 1126
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4192 KB)

    The issue of software partition deals with the process of mapping the given set of logical modules, which reflect the user's point of view, into a set of software tasks, which reflect the software implementor's point of view. It is shown in this paper that the software partitioning problem can be modeled as one that maximizes the efficiency in resource utilization while observing the constraints o... View full abstract»

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

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

    Remote procedure call (RPC) is a programming primitive that makes building distributed programs easier. Atomicity, whkh implies totality and serializability, has been recognized as an important property to assure consistency in spite of computing node crashes. We have implemented an atomk remote procedure call mechanism which provides users a simple and reliable language primitive. Concurrency is ... View full abstract»

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

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

    An efficient decentralized algorithm for synchronized termination of a distributed computation is presented. It is assumed that distributed processes are connected via unidirectional channels into a strongly connected network, in which no central controller exists. The number of processes and the network configuration are not known a priori. The number of steps required to terminate distributed co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability and Distributed Scheduling Algorithms

    Publication Year: 1985, Page(s):1141 - 1152
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3896 KB)

    Many distributed scheduling algorithms have been developed and reported in the current literature. However, very few of them explicitly treat stability issues. This paper first discusses stability issues for distributed scheduling algorithms in general terms. Two very different distributed scheduling algorithms which contain explicit mechanisms for stability are then presented and evaluated with r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Distributed Drafting Algorithm for Load Balancing

    Publication Year: 1985, Page(s):1153 - 1161
    Cited by:  Papers (77)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3304 KB)

    It is desirable for the load in a distributed system to be balanced evenly. A dynamic process migration protocol is needed in order to achieve load balancing in a user transparent manner. A distributed algorthim for load balancing which is network topology independent is proposed in this paper. Different network topologies and low-level communications protocols affect the choice of only some syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Empirical Study of Distributed Application Performance

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

    A major reason for the rarity of distributed applications, despite the proliferation of networks, is the sensitivity of their performance to various aspects of the network environment. We demonstrate that distributed applications can run faster than local ones, using common hardware. We also show that the primary factors affecting performance are, in approximate order of importance: speed of the u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Analysis of the Effect of Network Parameters on the Performance of Distributed Database Systems

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

    Performance analysis studies of distributed database systems in the past have assumed that the message transmission time between any two nodes of a network is constant. They disregard the effect of communication network parameters such as network traffic, network topology, and capacity of transmission channels. In this paper, an analytical model is used to estimate the delays in transmission chann... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability Optimization in the Design of Distributed Systems

    Publication Year: 1985, Page(s):1184 - 1193
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4304 KB)

    The reliability of a distributed system depends on the reliabilities of its communication links and computing elements, as well as on the distribution of its resources, such as programs and data files. A useful measure of reliability in distributed systems is the terminal reliability between a pair of nodes which is the probability that at least one communication path exists between these nodes. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Post-Failure Reconfiguration of CSP Programs

    Publication Year: 1985, Page(s):1193 - 1202
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4240 KB)

    In this paper a technique called process merging is introduced. This technique allows the merging of two communicating sequential processes into a new single process. Thus, this technique can be used to reconfigure a distributed program after a faulty processing element has been detected. The technique is most applicable to dedicated multiple microprocessor systems where the need for continuous op... View full abstract»

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

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