Universal programmingsystems are developed for more cost-effective programming of high volume devices such as application specific integrated circuits (ASIC) and field programmable gate arrays (FPGA). The cost of ASI...
详细信息
Universal programmingsystems are developed for more cost-effective programming of high volume devices such as application specific integrated circuits (ASIC) and field programmable gate arrays (FPGA). The cost of ASIC fabrication is affected by the expenditure on development, the relatively high NRE charges and the price for the individual device itself. Although an individual FPGA can be programmed in a matter of several minutes, the programming cost for multiple identical parts still represent a considerable factor. The cost for programming FPGAs is significantly high that ASIC technology is the only rational solution.
Several mechanisms, based on the use of semaphores, have been proposed to provide solutions for synchronization problems. This paper reports the results of a comparison of seven such synchronization mechanisms.
Several mechanisms, based on the use of semaphores, have been proposed to provide solutions for synchronization problems. This paper reports the results of a comparison of seven such synchronization mechanisms.
In recent years the architecture of data base systems has become better understood and more clearly defined. In the course of this development the question of optimizing these systems has become more pronounced. Never...
详细信息
In recent years the architecture of data base systems has become better understood and more clearly defined. In the course of this development the question of optimizing these systems has become more pronounced. Nevertheless, the optimization of complex program systems like data base systems remains an especially difficult area. Structuring a system by means of levels of interfaces will improve the task. The paper attempts to establish the optimization discipline which a developer, or the system as such, must follow in a multi-level data base system when a top-down approach is taken. The motions of level, multi-level system and top-down optimization are made precise. It is shown that optimization is basically achieved by repeatedly constructing equivalent programs within various levels.
The first section of this paper discusses the DAIS Executive from the Application Programmers point of view with respect to the capabilities required and the interface that is presented. The second section of this pap...
详细信息
The first section of this paper discusses the DAIS Executive from the Application Programmers point of view with respect to the capabilities required and the interface that is presented. The second section of this paper is from the point of view of implementation. This is concerned with the control and optimization of the system's resources: Processors, I/O, and memory. This view of the DAIS Executive is concerned with a given implementation and discusses the characteristics of the current DAIS Executive implementation.
This paper discusses actual software reliability data obtained in an online real time environment. The measures used are the reliability function R(t) and the mean time between software errors MTBSE. How to measure th...
详细信息
This paper discusses actual software reliability data obtained in an online real time environment. The measures used are the reliability function R(t) and the mean time between software errors MTBSE. How to measure the operational data of R(t) or MTBSE and to analyze the measurement results are described, presenting collected reliability data. Some quantitative models are proposed which can be used to measure, manage and predict the level of perfection of software during the test stage.
A new solution for the two-processor scheduling problem is proposed which predominantly employs the Hu algorithm. Furthermore, special task dependency structures are introduced which essentially are composed of trees ...
详细信息
A new solution for the two-processor scheduling problem is proposed which predominantly employs the Hu algorithm. Furthermore, special task dependency structures are introduced which essentially are composed of trees and anti-trees, and include the structure of nested DO-loops. It is shown that the application of the Hu algorithm yields optimal schedules for an arbitrary number of processors.
A simulation model is presented for a hypothetical geographically distributed network computer. The approach is to design a general n node network simulator and then to particularize the input parameters to describe I...
详细信息
A simulation model is presented for a hypothetical geographically distributed network computer. The approach is to design a general n node network simulator and then to particularize the input parameters to describe ILLINET (the computer communications network at the University of Illinois.
This paper describes the characterization of a synthetic workload for performance evaluation of a new system before replacing a legacy system. The workload is used by CAPPLES, a capacity planning and performance analy...
详细信息
This paper describes the characterization of a synthetic workload for performance evaluation of a new system before replacing a legacy system. The workload is used by CAPPLES, a capacity planning and performance analysis method for the migration of legacy systems. Typical workload characterization problems are anticipated and discussed. Further, guidelines to characterize a CAPPLES workload for different migration scenarios are provided.
A simple technique for computing mean performance measures of closed single-class fork-join networks with exponential service time distribution is given here. This technique is similar to the mean value analysis techn...
详细信息
A simple technique for computing mean performance measures of closed single-class fork-join networks with exponential service time distribution is given here. This technique is similar to the mean value analysis technique for closed product-form networks and iterates on the number of customers in the network. Mean performance measures like the mean response times, queue lengths, and throughput of closed fork-join networks can be computed recursively without calculating the steady-state distribution of the network. The technique is based on the mean value equation for fork-join networks which relates the response time of a network to the mean service times at the service centers and the mean queue length of the system with one customer less. Unlike product-form networks, the mean value equation for fork-join networks is an approximation and the technique computes lower performance bound values for the fork-join network. However, it is a good approximation since the mean value equation is derived from an equation that exactly relates the response time of parallel systems to the degree of parallelism and the mean arrival queue length. Using simulation, it is shown that the relative error in the approximation is less than 5% in most cases. The error does not increase with each iteration.
The fundamental characteristics of measurement systems based on digital processing, with specific focus on virtual instruments and distributed measurement systems, are discussed. Its goal it to point out the character...
详细信息
The fundamental characteristics of measurement systems based on digital processing, with specific focus on virtual instruments and distributed measurement systems, are discussed. Its goal it to point out the characteristics and the features related to the issues, so as to achieve a better understanding of the effective usability of these technologies, avoid problems due to their superficial application, and promote the best use of these advanced, powerful methods.
暂无评论