Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Handbook of scheduling : Algorithms, models, and performance analysis (2004)
    Boca Raton :Chapman & Hall/CRC,
    Details
    Title: Handbook of scheduling : Algorithms, models, and performance analysis
    Author: Leung, Joseph Y.-T.
    Publisher: Boca Raton :Chapman & Hall/CRC,
    Year of publication: 2004
    Pages: XIX, getr. Zählung
    Series Statement: Chapman & Hall/CRC computer and information science series
    ISBN: 1-5848-8397-9
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 2
    Electronic Resource
    Electronic Resource
    A new algorithm for scheduling periodic, real-time tasks (1989)
    Springer
    Algorithmica 4 (1989), S. 209-219 
    Details
    ISSN: 1432-0541
    Keywords: Periodic ; Real-time tasks ; Multiprocessor system ; Schedulability ; co-NP-hard
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider the problem of preemptively scheduling a set of periodic, real-time tasks on a multiprocessor computer system. We give a new scheduling algorithm, the so-called Slack-Time Algorithm, and show that it is more effective than the known Deadline Algorithm. We also give an (exponential-time) algorithm to decide if a task system is schedulable by the Slack-Time or the Deadline Algorithm. The same algorithm can also be used to decide if a task system is schedulable by any given fixed-priority scheduling algorithm. This resolves an open question posed by Leung and Whitehead. Finally, it is shown that the problem of deciding if a task system is schedulable by the Slack-Time, the Deadline, or any given fixed-priority scheduling algorithm is co-NP-hard for each fixedm≥.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01553887
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Preemptive scheduling with release times and deadlines (1989)
    Springer
    Real-time systems 1 (1989), S. 265-281 
    Details
    ISSN: 1573-1383
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We consider the problem of deciding if there is a feasible preemptive schedule for a set of n independent tasks with release times and deadlines on m identical processors. The general problem is known to be solvable in O(n 3) time. In this paper, we study special cases for which faster algorithms exist. We introduce the notion of monotone schedules and study their properties. These properties are then exploited to devise fast algorithms for two special cases—the nested task systems and the non-overlapping task systems. We give an O(n log mn) time algorithm and an O(n log n+mn) time algorithm for nested task systems and non-overlapping task systems, respectively. Our algorithms generate at most O(n) and O(mn) preemptions for nested task systems and nonoverlapping task systems, respectively.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00365440
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    An efficient algorithm for allocating paged, drum-like storage (1978)
    Springer
    BIT 18 (1978), S. 52-66 
    Details
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Cody and Coffman have studied the problem of distributing a set of a equal-size records among the sectors of a drum-like storage device so as to minimize the average rotational latency cost. This paper is an extension of that work. We employ the same model but a different latency delay function. Motivated by the NP-completeness of the general problem and the fact that an arbitrary assignment can have an expected latency cost almost twice that of an optimal assignment, we propose and analyze a fast heuristic whose performance compares favorably with that of an optimal algorithm.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01947743
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...