@inproceedings{ba018dfe08934721b809fec01543971b,
title = "Pre-scheduling for synchronization in hard real-time systems",
abstract = "In future, real-time systems will consist of a number of concurrent processes performing a variety of unrelated or loosely related tasks requiring synchronization among them. The timing properties of synchronizing processes are affected clue to waiting time. Hence, it is important that the synchronization primitives are efficient and that they have bounded waiting times so that the processes are not starved and that they meet the dcadlines. In this paper, we present a technique in which synchronization constraints axe considercd during pre-schcduling. This technique involves no runtime synchronization overhead and allows reasoning about the timing properties of processes prior to run-time.",
author = "Tripathi, \{Satish K.\} and Vivek Nirkhe",
note = "Publisher Copyright: {\textcopyright} 1991, Springer Verlag. All rights reserved.; International Workshop on Operating Systems of the 1990s and Beyond, 1991 ; Conference date: 08-07-1991 Through 12-07-1991",
year = "1991",
doi = "10.1007/BFb0024531",
language = "English",
isbn = "9783540549871",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "102--108",
editor = "Jurgen Nehmer and Arthur Karshmer",
booktitle = "Operating Systems of the 90s and Beyond - International Workshop, Proceedings",
address = "Germany",
}