Article

Free access

Dynamic scheduling of concurrent tasks with cost performance trade-off

Authors:

Peng Yang,

Dirk Desmet,

Francky Catthoor,

Diederik VerkestAuthors Info & Claims

CASES '00: Proceedings of the 2000 international conference on Compilers, architecture, and synthesis for embedded systems

Pages 103 - 109

https://doi.org/10.1145/354880.354895

Published: 01 November 2000 Publication History

PDF eReader

Cited By

View all

He YHsu WLeiserson C(2007)Provably Efficient Two-Level Adaptive SchedulingJob Scheduling Strategies for Parallel Processing10.1007/978-3-540-71035-6_1(1-32)Online publication date: 2007
https://doi.org/10.1007/978-3-540-71035-6_1
He YHsu WLeiserson C(2006)Provably efficient two-level adaptive schedulingProceedings of the 12th international conference on Job scheduling strategies for parallel processing10.5555/1757044.1757045(1-32)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.5555/1757044.1757045
Verkest DYang PWong CMarchal PErnst R(2001)Optimisation problems for dynamic concurrent task-based systemsProceedings of the 2001 IEEE/ACM international conference on Computer-aided design10.5555/603095.603149(265-268)Online publication date: 4-Nov-2001
https://dl.acm.org/doi/10.5555/603095.603149
Show More Cited By

Dynamic scheduling of concurrent tasks with cost performance trade-off

Recommendations

Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors
ISORC '15: Proceedings of the 2015 IEEE 18th International Symposium on Real-Time Distributed Computing

Existing real-time multicore schedulers use either global or partitioned scheduling technique to schedule real-time tasks. Partitioned scheduling is a static approach in which, a task is mapped to a per-processor ready queue prior to scheduling it and ...
Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks

In this paper, we address the problem of the dynamic scheduling of skippable periodic task sets (i.e., period tasks allowing occasional skips of instances), together with aperiodic tasks. Scheduling of tasks is handled thanks to the merging of two ...
Single-machine scheduling with trade-off between number of tardy jobs and compression cost

We consider a single-machine scheduling problem, in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem, where no tardy jobs are allowed and the ...

Comments

Information & Contributors

Information

Published In

CASES '00: Proceedings of the 2000 international conference on Compilers, architecture, and synthesis for embedded systems

November 2000

200 pages

ISBN:1581133383

DOI:10.1145/354880

Chairman:
Chair The

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 52 of 230 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
604
Total Downloads

Downloads (Last 12 months)34
Downloads (Last 6 weeks)6

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

He YHsu WLeiserson C(2007)Provably Efficient Two-Level Adaptive SchedulingJob Scheduling Strategies for Parallel Processing10.1007/978-3-540-71035-6_1(1-32)Online publication date: 2007
https://doi.org/10.1007/978-3-540-71035-6_1
He YHsu WLeiserson C(2006)Provably efficient two-level adaptive schedulingProceedings of the 12th international conference on Job scheduling strategies for parallel processing10.5555/1757044.1757045(1-32)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.5555/1757044.1757045
Verkest DYang PWong CMarchal PErnst R(2001)Optimisation problems for dynamic concurrent task-based systemsProceedings of the 2001 IEEE/ACM international conference on Computer-aided design10.5555/603095.603149(265-268)Online publication date: 4-Nov-2001
https://dl.acm.org/doi/10.5555/603095.603149
Wong CMarchal PYang PMadsen JHenkel JHu X(2001)Task concurrency management methodology to schedule the MPEG4 IM1 player on a highly parallel processor platformProceedings of the ninth international symposium on Hardware/software codesign10.1145/371636.371712(170-177)Online publication date: 25-Apr-2001
https://dl.acm.org/doi/10.1145/371636.371712
Verkest DYang PWong CMarchal P(2001)Optimisation problems for dynamic concurrent task-based systemsIEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281)10.1109/ICCAD.2001.968632(265-268)Online publication date: 2001
https://doi.org/10.1109/ICCAD.2001.968632

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors

Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks

Single-machine scheduling with trade-off between number of tardy jobs and compression cost

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Cited By

Recommendations

Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors

Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks

Single-machine scheduling with trade-off between number of tardy jobs and compression cost

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations