Please use this identifier to cite or link to this item:
Title: Multilevel static real-time scheduling algorithms using graph partitioning
Authors: Erciyeş, Kayhan
Soysert, Zehra
Keywords: Algorithms
Distributed real-time systems
Real time systems
Sequencing algorithms
Issue Date: 2005
Publisher: Springer Verlag
Source: Erciyeş, K., and Soysert, Z. (2005). Multilevel static real-time scheduling algorithms using graph partitioning. Lecture Notes in Computer Science, 3514(1), 196-203. doi:10.1007/11428831_25
Abstract: We propose static task allocation algorithms for the periodic tasks of a distributed real-time system. The cyclic task consists of task threads which may communicate and share resources. A graph partitioning process and a thread sequencing algorithm are applied to these threads to yield local schedules. The exact analysis is then obtained and further refinements are performed if the worst case response time of a task is greater than its deadline.
Description: 5th International Conference on Computational Science - ICCS 2005; Atlanta, GA; United States; 22 May 2005 through 25 May 2005
ISSN: 0302-9743
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File Description SizeFormat 
1973.pdfConference Paper140.64 kBAdobe PDFThumbnail
Show full item record

CORE Recommender

Page view(s)

checked on Oct 3, 2022


checked on Oct 3, 2022

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.