Heterogeneous computing covers a great variety of situations. This study focuses on a particular application domain (iterative automatic target recognition tasks) and an associated specific class of dedicated heteroge...
详细信息
Heterogeneous computing covers a great variety of situations. This study focuses on a particular application domain (iterative automatic target recognition tasks) and an associated specific class of dedicated heterogeneous hardware platforms. The contribution of this paper is that, for the computational environment considered, it presents a methodology for real-time on-line input-data dependent remappings of the application subtasks to the processors in the heterogeneous hardware platform using previously stored off-line statically determined mappings. That is, the operating system will be able to decide during the execution of the application whether or not to perform a remapping based on information generated by the application from its input data. If the decision is to remap, the operating system will be able to select a previously derived and stored mapping that is appropriate for the given state of the application (e.g., the number of objects it is currently tracking).
An introduction to, and an overview of, a real-time, multiprogrammed operating system nucleus is presented. Taking a tutorial slant, the paper presents both the hardware and software interrupt mechanisms utilized in s...
详细信息
The architecture of most interactive systems is based on the general strategy that suitable terminal service can be provided by a central processor that is timemultiplexed among all the active terminals. In order to a...
详细信息
The various aspects of two new collectors, Laplace and kVMTrace, that log the kernel-level information needed to drive multiprogrammed simulations, are discussed. There are two components to Laplace, namely, a modifie...
详细信息
The various aspects of two new collectors, Laplace and kVMTrace, that log the kernel-level information needed to drive multiprogrammed simulations, are discussed. There are two components to Laplace, namely, a modified machine simulator and a modified kernel. There is only one component to kVMTrace, the modified kernel, which emits both the reference and kernel event traces, where each contains the same basic information as with Laplace. The post-processor reconciles the information from the two streams and them emits a set of traces, one per thread, that can be used as the input for a multiprogrammed simulation.
Traces of numerical programs are used to examine their behavior in a paged virtual memory system. The working set policy is used for the replacement algorithm. It is found that the behavior of such programs is differe...
详细信息
Time-limited based polling systems with polling tables are encountered frequently in operating systems schedulers such as the Fair Share Scheduler. The analysis of such systems are usually carried out by simulation. I...
详细信息
Time-limited based polling systems with polling tables are encountered frequently in operating systems schedulers such as the Fair Share Scheduler. The analysis of such systems are usually carried out by simulation. In this paper we present a simple approximation for determining the mean waiting times in such polling systems. This approximation can be used by system designers to carry out a first cut design to reduce the set of alternative designs and then use simulation to assess few good designs. The method transforms the M table polling system with N distinct stations, (N &le M), to an equivalent M pseudostations cyclic polling system. It then uses the known K-limited polling results by approximating K from the time limit and the mean service time of each station.
This paper reports initial results from an empirical study directed at the measurement of program operating behavior in those multiprogramming systems in which programs are organized into fixed length pages. The data ...
详细信息
One of the common uses of bitmap terminals is storing multiple programming contexts in multiple, possibly overlapping, areas of the screen called windows. Windows traditionally store the visible state of a programming...
详细信息
We consider a probabilistic model of a computer system with multipro-gramming and paging. The applied work-load is derived from measurements in scientific computer applications and is characterized by a great variance...
详细信息
In multiprogrammed systems, synchronization often turns out to be a performance bottleneck and the source of poor fault-tolerance. Wait-free and lock-free algorithms can do without locking mechanisms, and therefore do...
详细信息
ISBN:
(纸本)0769521320
In multiprogrammed systems, synchronization often turns out to be a performance bottleneck and the source of poor fault-tolerance. Wait-free and lock-free algorithms can do without locking mechanisms, and therefore do not suffer from these problems. We present an efficient almost wait-free algorithm for parallel accessible hashtables, which promises more robust performance and reliability than conventional lock-based implementations. Our solution is as efficient as sequential hashtables. It can easily be implemented using C-like languages and requires on average only constant time for insertion, deletion or accessing of elements. The algorithm allows the hashtables to grow and shrink when needed. A true problem of wait-free and lock-free algorithms is that they are hard to design correctly, even when apparently straightforward. The reason for this is that processes can execute all statements in every conceivable order. Since our algorithm is quite large and rather complex, we turned to the interactive theorem prover PVS to prove safety of our algorithm, which we could not have done reliably by hand. To our knowledge no algorithms of comparable complexity have ever been mechanically verified. Wait-freedom is shown informally.
暂无评论