ACM Home Page
Please provide us with feedback. Feedback
Scheduling within temporal partitions: response-time analysis and server design
Full text PdfPdf (178 KB)
Source International Conference On Embedded Software archive
Proceedings of the 4th ACM international conference on Embedded software table of contents
Pisa, Italy
SESSION: Scheduling table of contents
Pages: 95 - 103  
Year of Publication: 2004
ISBN:1-58113-860-1
Authors
Luis Almeida  Universidade de Aveiro, Aveiro, Portugal
Paulo Pedreiras  Universidade de Aveiro, Aveiro, Portugal
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 73,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1017753.1017772
What is a DOI?

ABSTRACT

As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum level of interference. This can be achieved using temporal partitions, with each application assigned to its own partition and executing as if it was executing alone on a resource with lower bandwidth. The partitions are associated to servers that execute the application tasks according to a given application-level scheduler. On the other hand, the set of servers is scheduled by a system-level scheduler. This paper addresses the particular case of fixed priorities-based application-level schedulers together with a periodic server model at the system level. It starts with an adequate response time analysis based on the notion of server availability for a known server. Then it addresses the inverse problem of designing a server with minimum system-level resource requirements to fulfill the application time constraints. In this context, the paper shows that response time based schedulability tests with linear time bounds do not need to consider all tasks but just a small subset, which may lead to substantial speed-ups. The proposed method goes a step further with respect to other recent works in the literature by considering a more complete task model, effectively computing the server parameters and establishing a better trade-off concerning complexity and tightness.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Almeida L., P. Pedreiras, J. A. Fonseca, The FTT-CAN Protocol: Why and How, IEEE Transactions on Industrial Electronics, 49(6), December 2002.
 
2
 
3
Audsley, N., A. Burns, M. Richardson, K. Tindell and A. Wellings. Applying New Scheduling Theory to Static Priority Pre-Emptive Scheduling. Software Engineering Journal, 8(5): 285--292, 1993.
 
4
Lipari G. and E. Bini. Resource Partitioning among Real-Time Applications. Proc. of ECRTS'03 (EUROMICRO Conf. on Real-Time Systems). Porto, Portugal. July 2003.
 
5
 
6
 
7
 
8
Rushby, J., A Comparison of Bus Architectures for Safety-Critical Embedded Systems, CSL Technical Report, SRI International, September 2001.
 
9
 
10
Almeida, L. Response-Time Analysis and Server Design for Hierarchical Scheduling. Proc. of the Work-in-Progress session of RTSS'03 (IEEE Real-Time Systems Symposium). Cancun, Mexico. December 2003.
 
11
 
12
 
13
Pedreiras, P. and L. Almeida. Combining Time and Event-triggered Traffic in FTT-CAN. Proc. of WFCS'00 (IEEE Work. Factory Communication Systems). Porto, Portugal. Sept 2000.
 
14


Collaborative Colleagues:
Luis Almeida: colleagues
Paulo Pedreiras: colleagues