Provably Efficient Non-Preemptive Task Scheduling with ... - CiteSeerX
Recommend Documents
backtracks to a node where a stack S is build, if no task is in progress at this event, (i.e., ... p6), the number of backtracks is far more reasonable, which is a good ...
A note on DreemDtive scheduling of Deriodic. real-time task Information Proc&sing^ Letter, '11 (3):115-. 118, 1980. [16] Eugene L. Lawler and Charles U. Martel.
a longer path to the destination, leading to higher end-to-end delay, and packets ... void-filling-based scheduling algorithms, we need to use tail dropping on the ...
scheduling algorithms were proposed in [11] that uses Configuration Call Graph ...... Iran Telecommunication Research Center (ITRC) and Hartes project for ...
College of Engineering, Guindy, Anna university,. Chennai . [email protected], [email protected]. Abstract. Cloud Computing refers to the use of ...
Department of Computer Science and Engineering, PSG College of Technology, ... the jobs are processed at the grid resources in a fine-grained form that results in a low ..... position value of the ith particle best with respect to the n dimension.
In this paper, we present an algorithm called CASS-II for task clustering with no duplication which is competitive to. DSC in terms of both speed and solution ...
published and some new) that answer multidimensional range queries in ... of the form O(logBn+t/B) and space usage close to linear. (O(n/B)), for range ... between temporal intervals while the latter suggests that ... modelled by five binary variable
Feb 16, 2010 - David I Shuman and Mingyan Liu are with the Electrical Engineering and Computer Science Department, University of. Michigan, Ann Arbor, MI ...
In this paper we propose a hybrid policy, called eager scheduling with lazy retry (ESLR). This policy tries to schedule a task eagerly upon its arrival.
Feb 3, 2009 - to heterogeneous hardware/software computing systems us- ing heuristic ... tion of clustering, mapping, and scheduling in a single step and (2) ...
Jun 16, 1999 - is to develop and validate a general adaptive scheduling algorithm for task farming ... mote procedure call (i.e a call without side e ects). .... full- edge software for all UNIX avors, Win32 C, and Matlab APIs, can be ..... Agreement
In this paper we formulate and study a new scheduling problem called Selfish Multi-User Task Scheduling. This problem assumes that there are several users, ...
graph model for allocation mechanism design. In Section IV we develop a distributed negotiation strategy to achieve locally efficient and fair allocation under the ...
AbstractâWe propose a suite of market-oriented task schedul- ing algorithms to build ... distributed computing platforms, such as P2P, grid, and cloud computing ...
Oct 10, 2008 - The link utilization profiles, the link propagation delays, the ..... transmission is Rpi(b), defined as the first position after which. Äpi has b ...
given specification by scheduling the task graph as shown in. Figure 1(b). The horizontal .... throughput of a DSP program for homogeneous multi- processor ..... [2] K. Asnovic et al., âThe landscape of parallel computing research: A view from ...
for Embedded Real Time Systems. Ravindra Jejurikar and Rajesh Gupta. Center
for Embedded Computer Systems,. Department of Information and Computer ...
the rate monotonic (RM) scheduling and the earliest deadline first (EDF) [1], [2] scheduling, respectively. Most of the earlier works on energy-aware scheduling.
Abstract. The goal of the Provably Correct Systems project (ProCoS) is to develop a mathematical basis for development of embedded, real- time, computer ...
Energy-Aware Task Scheduling With Task. Synchronization for Embedded Real-
Time Systems. Ravindra Jejurikar, Student Member, IEEE, and Rajesh Gupta, ...
ods rely on exact knowledge of the execution time of dif- ferent tasks at compile time. However, real task execution times can vary significantly across different ...
Aug 11, 1997 - ... of the 1997 International Conference on Parallel Processing, August 1997. Hindsight Helps: Deterministic Task Scheduling with Backtracking.
scheduling · Heterogeneous · Heuristic algorithm. 1 Introduction. Large-scale businesses and scientific applications, which are usually composed of big-data, ...
Provably Efficient Non-Preemptive Task Scheduling with ... - CiteSeerX
graphs by using Cilk, a C-based runtime system for multithreaded parallel ... stages, and bundles parallel tasks of the same stage into one Cilk procedure.
Provably Efficient Non-Preemptive Task Scheduling with Cilk V. -Y. Vee and W.-J. Hsu School of Applied Science, Nanyang Technological University Nanyang Avenue, Singapore 639798. Abstract We consider the problem of scheduling static task graphs by using Cilk, a C-based runtime system for multithreaded parallel programming. We assume no pre-emption of task execution and no prior knowledge of the task execution times. Given a task graph G, the output of the scheduling algorithm is a Cilk program P which, when executed, initiates the tasks in consistence with the precedence requirements of G. We show that the Cilk model has restrictions in implementing optimal schedules for certain types of task graphs; however, the restriction does not fundamentally hinder the practical applications of Cilk, as it is possible to produce reasonably good quality schedules (in the sense of expected execution time). Our algorithm identifies a minimal number of stages, assigns tasks to these stages, and bundles parallel tasks of the same stage into one Cilk procedure. By using Tarjan’s algorithm (for set operations) to implement the bundling process, we demonstrate that the parallel schedule can be derived in O(n+e) time for all practical purposes, where n and e denote the number of nodes and edges in the task graph G. With P processors, the expected completion time for the scheduled tasks is bounded by Tp = O(T1/P+S), where T1 denotes the total work, i.e., the time required for executing all tasks on a single processor, and S denotes the sum (over all stages) of the longest execution time of the tasks at each stage. When the execution times of tasks are relatively homogeneous, the quality of the schedule generated by using our approach is nearly optimal. Index Terms: Scheduling, Cilk.
1
Introduction Task scheduling is one of the most
challenging problems in parallel and distributed computing [1]. The scheduling of an arbitrary task graph on arbitrary number of processors is NPcomplete [1,6]. We will introduce a sub-optimal approach to perform task scheduling based on Cilk, a provably efficient run-time system for multithreaded programming [2,4]. A set of tasks T will be specified as a strict (irreflexive) partially ordered set (T,
