On the solution of multiattribute problems involving counting in intersecting setsInternational Journal of Computer & Information Sciences - Tập 6 - Trang 1-7 - 1977
Herbert Hellerman, Roger Cavallo
A method is presented for computing the number of elements in any collection of sets derived from other sets by statements that are reducible to conjunctions, disjunctions, and complementations. The technique also detects certain inconsistencies that may be present in the given data. The method is applicable to a wide range of problems in computer science, actuarial studies, survey statistics, and...... hiện toàn bộ
FAIRIO: A Throughput-oriented Algorithm for Differentiated I/O PerformanceInternational Journal of Computer & Information Sciences - Tập 42 - Trang 165-197 - 2012
Sarala Arunagiri, Yipkei Kwok, Patricia J. Teller, Ricardo A. Portillo, Seetharami R. Seelam
Providing differentiated service in a consolidated storage environment is a challenging task. To address this problem, we introduce FAIRIO, a cycle-based I/O scheduling algorithm that provides differentiated service to workloads concurrently accessing a consolidated RAID storage system. FAIRIO enforces proportional sharing of I/O service through fair scheduling of disk time. During each cycle of t...... hiện toàn bộ
Parallelization of Control Recurrences for ILP ProcessorsInternational Journal of Computer & Information Sciences - Tập 24 - Trang 65-102 - 2016
Michael Schlansker, Vinod Kathail, Sadun Anik
The performance of applications executing on processors with instruction level parallelism is often limited by control and data dependences. Performance bottlenecks caused by dependences can frequently be eliminated through transformations which reduce the height of critical paths through the program. The utility of these techniques can be demonstrated in an increasingly broad range of important s...... hiện toàn bộ
Important announcementInternational Journal of Computer & Information Sciences - Tập 14 Số 6 - Trang 331-331 - 1985
Scheduling in or-parallel Prolog systems: Survey and open problemsInternational Journal of Computer & Information Sciences - - 1991
Andrzej Ciepielewski
Implementation of or-parallel Prolog systems offers a number of interesting scheduling problems. The main issues are the interaction between memory models and scheduling, ordering of multiple solutions, and scheduling of speculative work. The problems occur partly because of the design choices (e.g. the choice of a memory model), and partly because of the desire to maintain observational equivalen...... hiện toàn bộ
ConnectionismInternational Journal of Computer & Information Sciences - Tập 16 - Trang 339-339 - 1987
Using the First-Level Caches as Filters to Reduce the Pollution Caused by Speculative Memory ReferencesInternational Journal of Computer & Information Sciences - Tập 33 - Trang 529-559 - 2005
Onur Mutlu, Hyesoon Kim, David N. Armstrong, Yale N. Patt
High-performance processors employ aggressive branch prediction and prefetching techniques to increase performance. Speculative memory references caused by these techniques sometimes bring data into the caches that are not needed by correct execution. This paper proposes the use of the first-level caches as filters that predict the usefulness of speculative memory references. With the proposed tec...... hiện toàn bộ