Among many DAG scheduling algorithms targeting at maximizing DAG ready tasks to cope with temporal uncertainties that occurs during task execution, the PB heuristic seems promising. This paper presents the work of ada...
详细信息
ISBN:
(纸本)9781509036776
Among many DAG scheduling algorithms targeting at maximizing DAG ready tasks to cope with temporal uncertainties that occurs during task execution, the PB heuristic seems promising. This paper presents the work of adapting PB to a real distributed multi-core computing system with the PaRSEC scheduling runtime. The application performance results before and after adapting the PB heuristic to PaRSEC are evaluated and compared with different settings on application size and compute node configuration. We analyze the results and conclude with an assessment of the usability of the DAG ready task maximization algorithm on multi-core computing platforms.
Graph coloring is the task of assigning colors or labels to elements of a graph (edges or vertices) subject to some constraints. Time table scheduling requires efficient allocation of resources in a way that no confli...
详细信息
The problem of allocating jobs to a set of parallel unrelated machines in a make to stock manufacturing system is studied. The items are subdivided into families of similar products. Sequence-dependent setups arise wh...
详细信息
Taking the locomotive running time between goods operation sites as weights, wagons'placing-in and taking-out problems can be regarded as a single machine scheduling problem 1| pij | Cij, which can be transformed ...
详细信息
We consider the joint upstreaming of live and on-demand user-generated video content over LTE using a Quality-of-Experience driven approach. We contribute to the state-of-the-art work on multimedia scheduling in three...
详细信息
This research proposes an algorithmic cache arrangement scheme to efficiently utilize existing hardware that are currently plagued with memory wall problem. The proposed scheme exploits straightforwardness of First-in...
详细信息
In this paper, a new scheduling algorithm has been introduced based on dynamic genetic algorithm, which is more efficient in comparison with the previous similar algorithms and has more reliability. SQEFG is a new pro...
详细信息
In this paper, multiuser waterfilling theory applied to subcarrier and power allocation in orthogonal frequency division multiplexing (OFDM) system is researched. Note that the traditional scheduling algorithm making ...
详细信息
This paper describes a distributed optimization algorithm for scheduling the operation of electro-thermal heating units, such as heat pumps (HP) or electric heaters (EH) within a day-ahead (DA) operation for covering ...
详细信息
In this paper, we study the scheduling and optimization problems of parallel query processing using interoperation parallelism in a shared-memory environment and propose our solutions for XPRS. We first study the sche...
详细信息
ISBN:
(纸本)0897915216
In this paper, we study the scheduling and optimization problems of parallel query processing using interoperation parallelism in a shared-memory environment and propose our solutions for XPRS. We first study the scheduling problem of a set of a continuous sequence of independent tasks that are either from a bushy tree plan of a single query or from the plans of multiple queries, and present a clean and simple scheduling algorithm. Our scheduling algorithm achieves maximum resource utilizations by running an IO-bound task and a CPU-bound task in parallel with carefully calculated degrees of parallelism and maintains the maximum resource utilizations by dynamically adjusting the degrees of parallelism of running tasks whenever necessary. Real performance figures are shown to confirm the effectiveness of our scheduling algorithm. We also revisit the optimization problem of parallel execution plans of a single query and extend our previous results to consider inter-operation parallelism by introducing a new cost estimation method to the query optimizer based on our scheduling algorithm.
暂无评论