By Topic

IEEE Transactions on Software Engineering

Issue 10 • Date Oct 1991

Filter Results

Displaying Results 1 - 11 of 11
  • Temporal logic-based deadlock analysis for Ada

    Publication Year: 1991, Page(s):1109 - 1125
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1560 KB)

    A temporal logic-based specification language and deadlock analyzer for Ada is described. The deadlock analyzer is intended for use within Timebench, a concurrent system-design environment with support for Ada. The specification language, COL, uses linear-time temporal logic to provide a formal basis for axiomatic reasoning. The deadlock analysis tool uses the reasoning power of COL to demonstrate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic automata network of modeling parallel systems

    Publication Year: 1991, Page(s):1093 - 1108
    Cited by:  Papers (91)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1204 KB)

    A methodology for modeling a system composed of parallel activities with synchronization points is proposed. Specifically, an approach based on a modular state-transition representation of a parallel system called the stochastic automata network (SAN) is developed. The state-space explosion is handled by a decomposition technique. The dynamic behavior of the algorithm is analyzed under Markovian a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Task response time for real-time distributed systems with resource contentions

    Publication Year: 1991, Page(s):1076 - 1092
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1308 KB)

    An analytic model is proposed for estimating task response times in distributed systems with resource contentions. The model consists of two submodels. The first submodel is an extended queuing network model used for approximating module response times. This submodel is solved by a decomposition technique which reduces the computational complexity by two to three orders of magnitude when compared ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic analysis of a heterogeneous multiprocessor system in a randomly changing environment

    Publication Year: 1991, Page(s):1069 - 1075
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    An asymptotic queuing theoretic approach is proposed to analyze the performance of an FCFS (first-come, first-served) heterogeneous multiprocessor computer system with a single bus operating in a randomly changing environment. All stochastic times in the system are considered to be exponentially distributed and independent of the random environment, while the access and service rates of the proces... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance prediction and evaluation of parallel processing on a NUMA multiprocessor

    Publication Year: 1991, Page(s):1059 - 1068
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    The efficiency of the basic operations of a NUMA (nonuniform memory access) multiprocessor determines the parallel processing performance on a NUMA multiprocessor. The authors present several analytical models for predicting and evaluating the overhead of interprocessor communication, process scheduling, process synchronization, and remote memory access, where network contention and memory content... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MIDAS: integrated design and simulation of distributed systems

    Publication Year: 1991, Page(s):1042 - 1058
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1552 KB)

    An approach called MIDAS is described that supports the design of distributed systems via iterative refinement of hybrid models. A hybrid model is a partially implemented design where some components exist as simulation models and others as operational subsystems. It is an executable model and may be used to determine the stochastic performance characteristics of a partially elaborated design. MID... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semi-distributed load balancing for massively parallel multicomputer systems

    Publication Year: 1991, Page(s):987 - 1004
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1456 KB)

    A semidistributed approach is given for load balancing in large parallel and distributed systems which is different from the conventional centralized and fully distributed approaches. The proposed strategy uses a two-level hierarchical control by partitioning the interconnection structure of a distributed or multiprocessor system into independent symmetric regions (spheres) centered at some contro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Executing DSP applications in a fine-grained dataflow environment

    Publication Year: 1991, Page(s):1028 - 1041
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1132 KB)

    An experimental approach is chosen to investigate the performance of a fine-grained dataflow architecture for numerically intensive digital signal processing (DSP) applications. The focus is on the behavior of pipelined data-parallel algorithms. However, the granularity of the high-level language programming blocks is not explicitly optimized to balance computation and communication; a natural and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of Time Warp with multiple homogeneous processors

    Publication Year: 1991, Page(s):1013 - 1027
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1236 KB)

    The behavior of n interacting processors synchronized by the Time Warp protocol is analyzed using a discrete-state, continuous-time Markov chain model. The performance and dynamics of the processes (or processors) are analyzed under the following assumptions: exponential task times and timestamp increments on messages, each event message generates one new message that is sent to a randoml... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic derivation of formal software specifications from informal descriptions

    Publication Year: 1991, Page(s):1126 - 1142
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1416 KB)

    SPECIFIER, an interactive system which derives formal specifications of data types and programs from their informal descriptions, is described. The process of deriving formal specifications is viewed as a problem-solving process. The system uses common problem-solving techniques such as schemas, analogy, and difference-based reasoning to derive formal specifications. If an informal description is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic bounds on execution times of parallel programs

    Publication Year: 1991, Page(s):1005 - 1012
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Stochastic bounds are obtained on execution times of parallel programs when the number of processors is unlimited. A parallel program is considered to consist of interdependent tasks with synchronization constraints. These constraints are described by an acyclic directed graph called a task graph. The execution times of tasks are considered to be independently identically distributed (i.i.d.) rand... 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