Results 1 - 10 of 13,312

Scheduling Multithreaded Computations by Work Stealing

by Robert D. Blumofe , Charles E. Leiserson , 1994
"... This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMD-style computation is “work stealing," in which processors needing work steal com ..."
Abstract - Cited by 568 (34 self) - Add to MetaCart
This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMD-style computation is “work stealing," in which processors needing work steal

Space-Efficient Scheduling of Multithreaded Computations

by Robert D. Blumofe, Charles E. Leiserson - SIAM Journal on Computing , 1993
"... . This paper considers the problem of scheduling dynamic parallel computations to achieve linear speedup without using significantly more space per processor than that required for a single-processor execution. Utilizing a new graph-theoretic model of multithreaded computation, execution efficiency ..."
Abstract - Cited by 109 (15 self) - Add to MetaCart
. This paper considers the problem of scheduling dynamic parallel computations to achieve linear speedup without using significantly more space per processor than that required for a single-processor execution. Utilizing a new graph-theoretic model of multithreaded computation, execution efficiency

Trace Scheduling: A Technique for Global Microcode Compaction

by Joseph A. Fisher - IEEE TRANSACTIONS ON COMPUTERS , 1981
"... Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages int ..."
Abstract - Cited by 683 (5 self) - Add to MetaCart
into efficient horizontal microcode and good hand coding probably both require effective global compaction techniques. In this paper "trace scheduling" is developed as a solution to the global compaction problem. Trace scheduling works on traces (or paths) through microprograms. Compacting is thus done

Cilk: An Efficient Multithreaded Runtime System

by Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Yuli Zhou , 1995
"... Cilk (pronounced “silk”) is a C-based runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk work-stealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the “work” and “critical path ” of a Cilk co ..."
Abstract - Cited by 763 (33 self) - Add to MetaCart
Cilk (pronounced “silk”) is a C-based runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk work-stealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the “work” and “critical path ” of a Cilk

Process Design for Efficient Scheduling

by Evgeny Selensky, James Little, J. Christopher Beck - In Proc. 23 rd Annual Workshop of the UK Planning and Scheduling Special Interest Group , 2004
"... Abstract. In manufacturing, different process designs give rise to different schedules and with each an associated cost. In this paper, we report on a real-life example where a manufacturing company wants to evaluate the scheduling implications related to the degree of coupling between their process ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. In manufacturing, different process designs give rise to different schedules and with each an associated cost. In this paper, we report on a real-life example where a manufacturing company wants to evaluate the scheduling implications related to the degree of coupling between

Efficient scheduling for sensor networks

by Andreea Berfield, Daniel Mossé - in IWASN , 2006
"... Abstract — Sensor networks opened new opportunities to monitor the environment. In order to retrieve the desired data, sensors are usually organized into a hierarchy and synchronize when transmitting the data towards the base station. Many scheduling schemes have been proposed with the goal of allow ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract — Sensor networks opened new opportunities to monitor the environment. In order to retrieve the desired data, sensors are usually organized into a hierarchy and synchronize when transmitting the data towards the base station. Many scheduling schemes have been proposed with the goal

An efficient scheduling technique for the improvement . . .

by A. P. Thakare, et al. , 2013
"... This paper highlight about the maximization of network lifetime & minimization of delay parameter which is important to improve the performance of the wireless sensor network as effective and reliable Wireless mostly energy is used when communication radios are on. The network lifetime is usuall ..."
Abstract - Add to MetaCart
is usually defined as the time until the first node fails because of energy depletion. So sleep-wake scheduling is effective mechanism to increase network lifetime. Sleep-wake scheduling is efficient to increase network lifetime but it could result in substantial delays because a transmitting node needs

Efficient scheduling of DAGs . . .

by Ioannis Chatzigiannakis, Georgios Giannoulis, Paul G. Spirakis , 2008
"... In this work we model multicore platforms as chip multiprocessors made up from two different types cores; each type of cores has different computation capabilities. In this simple asymmetric multicore model we study the problem of executing parallel programs that are represented as DAGs or chains of ..."
Abstract - Add to MetaCart
of tasks. We assume 2 (essential) speeds in our proposed platform. We relax this assumption and consider many speeds in our energy considerations. This problem has been considered previously in the field of parallel computing and scheduling theory for the general case where multiprocessor platforms have K

Efficient Scheduling to Minimize Calibrations

by Michael A. Bender, David P. Bunde, Vitus J. Leung, Samuel Mccauley, Cynthia A. Phillips
"... Integrated Stockpile Evaluation (ISE) is a program to test nuclear weapons periodically. Tests are performed by machines that may require occasional calibration. These calibrations are expensive, so finding a schedule that minimizes calibrations allows more testing to be done for a given amount of m ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Integrated Stockpile Evaluation (ISE) is a program to test nuclear weapons periodically. Tests are performed by machines that may require occasional calibration. These calibrations are expensive, so finding a schedule that minimizes calibrations allows more testing to be done for a given amount

Lottery Scheduling: Flexible Proportional-Share Resource Management

by Carl A. Waldspurger, William E. Weihl , 1994
"... This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations. Such control is beyond the capabilities of conventional schedulers, and is desirable in systems that ..."
Abstract - Cited by 480 (5 self) - Add to MetaCart
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations. Such control is beyond the capabilities of conventional schedulers, and is desirable in systems
Results 1 - 10 of 13,312