Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity

From MaRDI portal
Publication:1274741
Jump to:navigation, search

DOI10.1016/S0020-0190(98)00131-8zbMath0925.68051OpenAlexW2054465734MaRDI QIDQ1274741

Taegeun Kim, Gihyun Jung, Kyunghee Choi, Seunhun Jung

Publication date: 12 January 1999

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00131-8


zbMATH Keywords

schedulingreal-time systemsimprecise computation


Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)


Related Items (2)

Scheduling imprecise computation tasks on uniform processors ⋮ Inverse scheduling with maximum lateness objective




Cites Work

  • Minimizing the weighted number of tardy task units
  • Algorithms for Scheduling Imprecise Computations with Timing Constraints
  • Minimizing Maximum Weighted Error for Imprecise Computation Tasks
  • Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error




This page was built for publication: Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1274741&oldid=13379573"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 10:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki