DC Field | Value | Language |
---|---|---|
dc.contributor.author | Baruah, Sanjoy | ko |
dc.contributor.author | Chattopadhyay, Bipasa | ko |
dc.contributor.author | Li, Haohan | ko |
dc.contributor.author | Shin, Insik | ko |
dc.date.accessioned | 2014-08-29T02:04:11Z | - |
dc.date.available | 2014-08-29T02:04:11Z | - |
dc.date.created | 2014-01-13 | - |
dc.date.created | 2014-01-13 | - |
dc.date.issued | 2014-01 | - |
dc.identifier.citation | REAL-TIME SYSTEMS, v.50, no.1, pp.142 - 177 | - |
dc.identifier.issn | 0922-6443 | - |
dc.identifier.uri | http://hdl.handle.net/10203/188954 | - |
dc.description.abstract | The scheduling of mixed-criticality implicit-deadline sporadic task systems on identical multiprocessor platforms is considered. Two approaches, one for global and another for partitioned scheduling, are described. Theoretical analyses and simulation experiments are used to compare the global and partitioned scheduling approaches. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.title | Mixed-criticality scheduling on multiprocessors | - |
dc.type | Article | - |
dc.identifier.wosid | 000328351200005 | - |
dc.identifier.scopusid | 2-s2.0-84891422797 | - |
dc.type.rims | ART | - |
dc.citation.volume | 50 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 142 | - |
dc.citation.endingpage | 177 | - |
dc.citation.publicationname | REAL-TIME SYSTEMS | - |
dc.identifier.doi | 10.1007/s11241-013-9184-2 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Shin, Insik | - |
dc.contributor.nonIdAuthor | Baruah, Sanjoy | - |
dc.contributor.nonIdAuthor | Chattopadhyay, Bipasa | - |
dc.contributor.nonIdAuthor | Li, Haohan | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Mixed criticalities | - |
dc.subject.keywordAuthor | Implicit-deadline sporadic tasks | - |
dc.subject.keywordAuthor | Multiprocessors | - |
dc.subject.keywordAuthor | Global scheduling | - |
dc.subject.keywordAuthor | Partitioned scheduling | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.