No abstract available.

The authors describe a simple, yet effective, distributed database model that simulates database usage and buffer management in the distributed data processing environment. The model is table driven such that database access requirements, file location, and other information defining the database environment are set up internally in several tables, and linked lists represent the directory and data blocks. Each database transaction is defined and represented by a transaction flow diagram (TFD), and a sequence of TFDs representing an operational scenario is input to the model. The model `executes' input TFDs by looking up tables, and performs buffer management for directory and file data while logging history and gathering various statistics on database usage and buffer management. The performance data are used for database access overhead measurement, database workload characterization, and buffer allocation. Disk access frequency and response time are used to validate the simulation results.

This paper describes a simple yet effective distributed database model that simulates database utilization in the distributed data processing environment. The model is table driven such that database access requirements, file location, and other information necessary for defining the database environment are set up internally in several tables. Each database transaction is defined and represented by a transaction flow diagram (TFD) and a sequence of TFDs representing a operational scenario is input to the model. The model "executes" input TFDs by looking up tables that specify their data file access requirements. While executing TFDs, the history of database usage is logged and various statistics are gathered. The performance data are used to measure database access overhead, characterize database workload, and fine-tune performance by reallocating files. The model has been implemented in Fortran on the VAX 11/780 and has been used for both measuring the given database performance and analyzing sensitivity to design changes. It has proven to be an effective tool for analyzing design effectiveness of distributed databases.

This paper presents a task allocation model that allocates application tasks among processors in distributed computing systems satisfying: 1) minimum interprocessor communication cost, 2) balanced utilization of each processor, and 3) all engineering application requirements.

Detection of concurrently executable microoperations is an important consideration for effective horizontal microprogramming. Since it is highly machine-dependent and requires knowledge of highly intricate features of a machine, only limited effort has been made so far to derive an algorithm for detection of microprogram parallelism to enable optimization of horizontal microprograms.

A high-level language, SIMPL (Single Identity MicroProgramming), for horizontal microprogramming has been developed. This language allows the SIMPL compiler to easily detect concurrent microoperations and to optimize their intricate timing and concurrency for generating highly parallel and efficient object microprograms in horizontal formats. This unique feature accrues from the single assignment concept for multiprocessing languages that was adapted to the design of SIMPL.