Processor-Minimum Scheduling of Real-Time Parallel Tasks

スポンサーリンク

概要

• 論文の詳細を見る

• We propose a polynomial-time algorithm for the scheduling of real-time parallel tasks on multicore processors. The proposed algorithm always finds a feasible schedule using the minimum number of processing cores, where tasks have properties of linear speedup, flexible preemption, arbitrary deadlines and arrivals, and parallelism bound. The time complexity of the proposed algorithm is O(M3· log N) for M tasks and N processors in the worst case.

• （社）電子情報通信学会の論文
• 2009-04-01

著者

• Lee Wan

  Hallym Univ. Kor

• Lee Wan

  Dept. Of Computer Engineering Hallym University

• Lee Wan

  Hallym Univ.

• Kim Kyong

  Gyeongsang National Univ. Jinju Kor

• LEE Kyungwoo

  Intel Corporation

• KO Young

  Hallym Univ.

関連論文

• Optimal Scheduling for Real-Time Parallel Tasks(Algorithm Theory)
• AdaFF : Adaptive Failure-Handling Framework for Composite Web Services
• Dynamic Two-Tier Cell Structure for Bandwidth Reservation of Handoffs in Cellular Networks
• Processor-Minimum Scheduling of Real-Time Parallel Tasks
• Maximizing Total QoS-Provisioning of Image Streams with Limited Energy Budget
• Enhancing Resiliency of Networks : Evolving Strategy vs. Multihoming
• Energy-Aware Error Correction for QoS-Provisioning Real-Time Communications in Wireless Networks
• Resiliency of Network Topologies under Path-Based Attacks(Internet)
• Energy-Saving Stochastic Scheduling of a Real-Time Parallel Task with Varying Computation Amount on Multi-Core Processors
• SLA-Based Scheduling of Bag-of-Tasks Applications on Power-Aware Cluster Systems
• Stochastic Power Minimization of Real-Time Tasks with Probabilistic Computations under Discrete Clock Frequencies

もっと見る 閉じる

スポンサーリンク