default search action
Real-Time Systems, Volume 52
Volume 52, Number 1, January 2016
- Pontus Ekberg, Wang Yi:
Schedulability analysis of a graph-based task model for mixed-criticality systems. 1-37 - Michael Zolda, Raimund Kirner:
Calculating WCET estimates from timed traces. 38-87 - Daniel Thiele, Johannes Schlatow, Philip Axer, Rolf Ernst:
Formal timing analysis of CAN-to-Ethernet gateway strategies in automotive networks. 88-112 - Robert I. Davis, Marko Bertogna, Vincenzo Bonifaci:
On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm. 113-122
Volume 52, Number 2, March 2016
- Joël Goossens, Claire Maiza:
Guest Editorial - RTNS 2014. 123-124 - Yasmina Abdeddaïm, Younès Chandarli, Robert I. Davis, Damien Masson:
Response time analysis for fixed priority real-time systems with energy-harvesting. 125-160 - Silviu S. Craciunas, Ramon Serna Oliver:
Combined task- and network-level scheduling for distributed time-triggered systems. 161-200 - Will Lunniss, Sebastian Altmeyer, Giuseppe Lipari, Robert I. Davis:
Cache related pre-emption delays in hierarchical scheduling. 201-238
Volume 52, Number 3, May 2016
- Jinchao Chen, Chenglie Du, Fei Xie, Zhenkun Yang:
Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems. 239-271 - Dakshina Dasari, Vincent Nélis, Benny Akesson:
A framework for memory contention analysis in multi-core platforms. 272-322 - Youcheng Sun, Giuseppe Lipari:
A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor Global Fixed-Priority scheduling. 323-355 - Hyoseung Kim, Dionisio de Niz, Björn Andersson, Mark H. Klein, Onur Mutlu, Ragunathan Rajkumar:
Bounding and reducing memory interference in COTS-based multi-core systems. 356-395
Volume 52, Number 4, July 2016
- Marco Caccamo, Marko Bertogna:
Guest editorial: special issue on multicore systems. 397-398 - Georgia Giannopoulou, Nikolay Stoimenov, Pengcheng Huang, Lothar Thiele, Benoît Dupont de Dinechin:
Mixed-criticality scheduling on cluster-based manycores with shared communication and storage resources. 399-449 - Muhammad Ali Awan, Patrick Meumeu Yomsi, Geoffrey Nelissen, Stefan M. Petters:
Energy-aware task mapping onto heterogeneous platforms using DVFS and sleep states. 450-485 - Paolo Valente:
Using a lag-balance property to tighten tardiness bounds for global EDF. 486-561
Volume 52, Number 5, September 2016
- Rolf Ernst:
Special issue of the Euromicro Conference on Real-Time Systems (ECRTS). 563-565 - Ernesto Massa, George Lima, Paul Regnier, Greg Levin, Scott A. Brandt:
Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems. 566-597 - Sebastian Altmeyer, Roeland Douma, Will Lunniss, Robert I. Davis:
On the effectiveness of cache partitioning in hard real-time systems. 598-643 - Sibin Mohan, Man-Ki Yoon, Rodolfo Pellizzoni, Rakesh B. Bobba:
Integrating security constraints into fixed priority real-time schedulers. 644-674 - Yonghui Li, Benny Akesson, Kees Goossens:
Architecture and analysis of a dynamically-scheduled real-time memory controller. 675-729
Volume 52, Number 6, November 2016
- Peter Altenbernd, Jan Gustafsson, Björn Lisper, Friedhelm Stappert:
Early execution time-estimation through automatically generated timing models. 731-760 - Zheng Pei Wu, Rodolfo Pellizzoni, Danlu Guo:
A composable worst case latency analysis for multi-rank DRAM devices under open row policy. 761-807 - Joël Goossens, Emmanuel Grolleau, Liliana Cucu-Grosjean:
Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms. 808-832 - Jian-Jia Chen:
Federated scheduling admits no constant speedup factors for constrained-deadline DAG task systems. 833-838
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.