Showing papers in "Journal of Systems and Software in 1986"

TL;DR: This paper is a survey of MILs that are specifically designed to support module interconnection and includes brief descriptions of some software development systems that support Module interconnection.

TL;DR: A method and a tool for generating test sets from algebraic data type specifications based on logic programming and two extensions are presented, METALOG and SLOG, which allow good implementations of the method.

TL;DR: An effective technique for the combined performance and reliability analysis of multimode computer systems and a useful dual relationship, between the completion time of a given job and the accumulated reward up to a given time, is noted.

TL;DR: The paper gives a notation for the pattern of rendezvous, a framework for translating a software/hardware system structure into an active-server queueing network model, and an implicit decomposition algorithm for solving for the system performance.

TL;DR: The particular structure of the generator associated to a C-Q net induces a third method to compute the steady-state probabilities that are more efficient for grouped arrival and departure.

TL;DR: In this article, generalized stochastic Petri net (GSPN) models are used to analyze the performance of a class of multiple-bus multiprocessor systems, exploiting the unusual simplicity of the state space of the Markov chains derived by firing the reachability graphs of GSPNs.

TL;DR: An algorithm is given to solve the reachability problem and the minimal reachability time from a source state to a sink state is computed and the asymptotic behavior of the “earliest” controlled execution of a timed-event graph is studied.

TL;DR: This paper summarizes over 4 yrs of experience in the use of a comprehensive environment for developing and maintaining interactive information systems and features of the environment that improve performance are identified.

TL;DR: The results in this field, the ''Coupled Actors,'' mechanism and the ''Activity Message'' concept are presented and two other projects, recently launched in the same domain, are outlined, building upon the CHORUS system.

TL;DR: This paper discusses some policies for performance-reliability improvement in distributed file systems that include concurrency control policy, which allows transaction type access to the shared resources.

TL;DR: Tests of the effect of deeply nested IF-THEN-ELSE statements on programmer comprehension indicate no significant difference in the average performance on the questions between the two groups.

TL;DR: This work describes a new algorithm, having polynomial space and time complexity, that is specifically designed for the solution of queueing networks in which the classes exhibit highly symmetric patterns and the service stations have identical service characteristics.

TL;DR: A practical and noniterative method for evaluating queueing networks in which delays due to locking of files are represented using measurable parameters using a queueing network model of a distributed file system.

TL;DR: A new approximation for the multiclass./M/1/FIFO queue in a closed context by replacing the FIFO discipline by a RANDOM one that gives very good results and appears more sophisticated than the previous methods.

TL;DR: The resulting Software Productivity Consortium (SPC) is the topic of this paper and aims to bring together a highly skilled blend of personnel who could concentrate their efforts specifically on software productivity.

TL;DR: Using standard multitasking tools on the CRAY X-MP, the Monte Carlo method and the conjugate gradient algorithm are presented, with very good performances and nearly optimal speed up for both problems.

TL;DR: This study compares performances of two distributed mutual-exclusion algorithms, using Lamport's time stamps, and shows the importance of synchronizations.

TL;DR: An algorithm for the stationary analysis of fault-tolerant queueing networks has been developed based on decomposition principles allowing for the separate analysis of a system's performance and availability behavior.

TL;DR: An approach is described that integrates such concepts as project significance level, software categorization, and life-cycle requirements, and implements them by means of a table-driven procedure that could easily be computerized.

TL;DR: The performance-evaluation issues for parallel algorithms are reviewed and a simple model for comparative evaluation of these algorithms is presented.

TL;DR: This work uses the Occam model of concurrency and plans to study the performance of Transputer arrays to discuss performance estimation for array processors to run specific algorithms.

TL;DR: The vectorization problem solved here gives a good example of methods efficient for graph problems and a vectorial and parallel algorithm that performs the transitive closure of a directed graph in an average O(n^2 log n) operations using an improved breadth-first method.

TL;DR: A simple and efficient implementation of Patchwork, a system that allows programs to be organized according to a dataflow model, in which the only overhead incurred is a single extra level of indirection when invoking a module or when a module accesses inputs, outputs, or local storage.

TL;DR: A gateway system which is designed to allow dissimilar systems to establish host-to-host communications and has the ability to perform protocol translation across all seven layers of the ISO reference model as opposed to the traditional link and physical layers.

TL;DR: This paper deals with a methodology for appreciating the efficiency of a parallel numerical algorithm by a simulation software allowing simplified runnings for the resolution of three-dimensional elliptical problems.

TL;DR: It is shown how one can decompose the partial differential equation so as to minimize the communication between processors as well as to maximize the computational tasks of the processors.

TL;DR: This technique is based on the concept of near-complete decomposability and uses variable aggregations and usesVariable aggregations for verification by simulation in order to derive the precision of the results.

TL;DR: The 4096 processor DAP performs far better than predicted by most methods of parallel-performance estimation, mainly due to the properties of bit-serial arithmetic, dynamic reconfiguration by software maintaining system utilization, and high performance on logical operations.

TL;DR: This paper considers system testing with respect to operating systems and, in particular, UNIX, and develops and presents a good approach to the development and performance of the system test.