Removing Abstraction Overhead in the Composition of Hierarchical Real-Time System
dc.contributor.author | Chen, Sanjian | |
dc.contributor.author | Phan, Linh T.X. | |
dc.contributor.author | Lee, Jaewoo | |
dc.contributor.author | Lee, Insup | |
dc.contributor.author | Sokolsky, Oleg | |
dc.date | 2023-05-17T06:12:21.000 | |
dc.date.accessioned | 2023-05-22T12:48:41Z | |
dc.date.available | 2023-05-22T12:48:41Z | |
dc.date.issued | 2011-04-01 | |
dc.date.submitted | 2011-05-04T14:47:14-07:00 | |
dc.description.abstract | The hierarchical real-time scheduling framework is a widely accepted model to facilitate the design and analysis of the increasingly complex real-time systems. Interface abstraction and composition are the key issues in the hierarchical scheduling framework analysis. Schedulability is essential to guarantee that the timing requirements of all components are satisfied. In order for the design to be resource efficient, the composition must be bandwidth optimal. Associativity is desirable for open systems in which components may be added or deleted at run time. Previous techniques on compositional scheduling are either not resource efficient in some aspects, or cannot achieve optimality and associativity at the same time. In this paper, several important properties regarding the periodic resource model are identified. Based on those properties, we propose a novel interface abstraction and composition framework which achieves schedulability, optimality, and associativity. Our approach eliminates abstraction overhead in the composition. | |
dc.description.comments | 17th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2011), Chicago, April 12-14, 2011. | |
dc.identifier.uri | https://repository.upenn.edu/handle/20.500.14332/6517 | |
dc.legacy.articleid | 1501 | |
dc.legacy.fields | 10.1109/RTAS.2011.16 | |
dc.legacy.fulltexturl | https://repository.upenn.edu/cgi/viewcontent.cgi?article=1501&context=cis_papers&unstamped=1 | |
dc.rights | © 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | |
dc.source.beginpage | 81 | |
dc.source.endpage | 90 | |
dc.source.issue | 463 | |
dc.source.journal | Departmental Papers (CIS) | |
dc.source.journaltitle | 17th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2011) | |
dc.source.peerreviewed | true | |
dc.source.status | published | |
dc.subject.other | CPS Real-Time | |
dc.subject.other | Real-time embedded systems | |
dc.subject.other | compositional scheduling | |
dc.subject.other | bandwidth-optimal interface | |
dc.subject.other | abstraction overhead | |
dc.title | Removing Abstraction Overhead in the Composition of Hierarchical Real-Time System | |
dc.type | Presentation | |
digcom.identifier | cis_papers/463 | |
digcom.identifier.contextkey | 2001671 | |
digcom.identifier.submissionpath | cis_papers/463 | |
digcom.type | conference | |
dspace.entity.type | Publication | |
relation.isAuthorOfPublication | 07085e59-bb6d-4302-a53b-b7fbded24b2b | |
relation.isAuthorOfPublication | a98b0c04-c9b9-42bc-8835-96cd30324015 | |
relation.isAuthorOfPublication | a099254e-b523-422c-bc78-402b2eeaad86 | |
relation.isAuthorOfPublication | 45a9eed5-3211-4c36-b40d-6394302dfdce | |
relation.isAuthorOfPublication | 35e1b18e-15fe-4438-be3b-84593f70a40a | |
relation.isAuthorOfPublication.latestForDiscovery | 07085e59-bb6d-4302-a53b-b7fbded24b2b | |
upenn.schoolDepartmentCenter | Departmental Papers (CIS) |
Files
Original bundle
1 - 1 of 1