SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:research.chalmers.se:5ab5dc0b-3425-4434-a44d-581ed25dd3b2"
 

Search: onr:"swepub:oai:research.chalmers.se:5ab5dc0b-3425-4434-a44d-581ed25dd3b2" > Partitioned Aperiod...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Andersson, Björn,1974Chalmers tekniska högskola,Chalmers University of Technology (author)

Partitioned Aperiodic Scheduling on Multiprocessors

  • Article/chapterEnglish2003

Publisher, publication year, extent ...

  • 2003

Numbers

  • LIBRIS-ID:oai:research.chalmers.se:5ab5dc0b-3425-4434-a44d-581ed25dd3b2
  • ISBN:0769519261
  • https://doi.org/10.1109/IPDPS.2003.1213083DOI
  • https://research.chalmers.se/publication/173902URI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:kon swepub-publicationtype
  • Subject category:ref swepub-contenttype

Notes

  • This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. We propose an algorithm for tasks without migration capabilities and prove that it has a capacity bound of 0.31. No algorithm for tasks without migration capabilities can have a capacity bound greater than 0.50.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Abdelzaher, T.University of Virginia (author)
  • Jonsson, Jan,1962Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)janjo (author)
  • Chalmers tekniska högskolaUniversity of Virginia (creator_code:org_t)

Related titles

  • In:Proceedings. International Parallel and Distributed Processing Symposium, 20031530-20750769519261

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view