Preemptive scheduling of independent jobs on a hypercube

Chen, Guaning; Lai, Ten-Hwang

doi:10.1016/0020-0190(88)90209-8

Cited by 32 publications

(11 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm differs from the one from [31] in the use of pseudo-stairlike schedules. In the pseudo-stairlike schedule a task is not filling 'steps' one by one, but fills at most two "steps' (subcubes): one from the moment it becomes available till the end of the schedule and possibly one m ore but only partially.…”

Section: E" 6) <mentioning

confidence: 99%

See 1 more Smart Citation

Scheduling multiprocessor tasks — An overview

Drozdowski

1996

European Journal of Operational Research

219

View full text Add to dashboard Cite

Section: E" 6) <mentioning

confidence: 99%

“…Problem P I cube s, pmtnlCmax of scheduling on hypercube has been tackled in [31]. An O(n 2) algorithm has been proposed to test whether a feasible schedule of length T exists.…”

Section: E" 6) <mentioning

confidence: 99%

Scheduling multiprocessor tasks — An overview

Drozdowski

1996

European Journal of Operational Research

219

View full text Add to dashboard Cite

“…Static algorithms are appropriate to a very specialized class of systems in which this information is available, including some real-time systems. Numerous static algorithms have been proposed, including [2,3,21]. Dynamic scheduling, on the other hand, assumes a continuous stochastic stream of arriving jobs.…”

Section: Introductionmentioning

confidence: 99%

“…A precedence constraint disallows a job from beginning execution until the jobs on which it depends have completed. 2 We assume that the size of the subcube necessary to accommodate a given job has been determined before it is submitted to the system. Research that addresses this step includes [4,17].…”

mentioning

confidence: 99%

The Effects of Precedence and Priority Constraints on the Performance of Scan Scheduling for Hypercube Multiprocessors

Krueger¹,

Babbar

1996

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…The performance of a moldable task is directly related to the number of allocated cores. Suboptimal solutions for scheduling moldable tasks have been studied in [6], [7] and [11].…”

Section: Related Workmentioning

confidence: 99%

Task Scheduling on Adaptive Multi-Core

Pricopi

Mitra

2014

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-Multi-cores have become ubiquitous both in the general-purpose computing and the embedded domain. The current technology trends show that the number of on-chip cores is rapidly increasing, while their complexity is decreasing due to power and thermal constraints. Increasing number of simple cores enable parallel applications benefit from abundant threadlevel parallelism (TLP), while sequential fragments suffer from poor exploitation of instruction-level parallelism (ILP). Recent research has proposed adaptive multi-core architectures that are capable of coalescing simple physical cores to create more complex virtual cores so as to accelerate sequential code. Such adaptive architectures can seamlessly exploit both ILP and TLP.The goal of this paper is to quantitatively characterize the performance potential of adaptive multi-core architectures. Previous research have primarily focused on only sequential workload on adaptive multi-cores. We address a more realistic scenario where parallel and sequential applications co-exist on an adaptive multi-core platform. Scheduling tasks on adaptive architectures reveals challenging resource allocation problems for the existing schedulers. We construct offline and online schedulers that intelligently reconfigure and allocate the cores to the applications so as to minimize the overall makespan under the constraints of a realistic adaptive multi-core architecture. Experimental results reveal that adaptive multi-core architectures can substantially decrease the makespan compared to both static symmetric and asymmetric multi-core architectures.

show abstract

Preemptive scheduling of independent jobs on a hypercube

Cited by 32 publications

References 2 publications

Scheduling multiprocessor tasks — An overview

Scheduling multiprocessor tasks — An overview

The Effects of Precedence and Priority Constraints on the Performance of Scan Scheduling for Hypercube Multiprocessors

Task Scheduling on Adaptive Multi-Core

Contact Info

Product

Resources

About