Exact schedulability analysis of global multi-processor IUF scheduling using symbolic model checking

Alok Lele, Ajith Kumar, H. M. Rohith, Sanjay Singh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Real time scheduling spans a broad spectrum of algorithms for simple uniprocessors to highly sophisticated multiprocessors. As the world nears the end of Moore's Law, more emphasis is being laid on the use of multi-processors in embedded systems. This has lead to a rise in several new scheduling schemes for multi-processor environments. Naturally there arises a need for an accurate comparison of the schedulabilities of each of these schemes in order to prove their superiority over others. The two-fold aim of this paper is to present a technique for the exact schedulability analysis of global multi-processor schedulers and, based on this intermediary result, prove the schedulability superiority of a novel multi-processor scheduling algorithm. The exact schedulability analysis technique presented here is symbolic model checking in NuSMV, and we have used this technique to investigate the schedulability of global Instantaneous Utilization Factor (IUF) based scheduling. Our analysis shows a substantial improvement in the acceptance of task sets with heavier utilizations.

Original languageEnglish
Title of host publication2010 5th International Conference on Industrial and Information Systems, ICIIS 2010
Pages281-285
Number of pages5
DOIs
Publication statusPublished - 02-11-2010
Event2010 5th International Conference on Industrial and Information Systems, ICIIS 2010 - Mangalore, Karnataka, India
Duration: 29-07-201001-08-2010

Conference

Conference2010 5th International Conference on Industrial and Information Systems, ICIIS 2010
CountryIndia
CityMangalore, Karnataka
Period29-07-1001-08-10

Fingerprint

Model checking
Scheduling
Scheduling algorithms
Embedded systems
Factors

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Information Systems and Management
  • Industrial and Manufacturing Engineering

Cite this

Lele, A., Kumar, A., Rohith, H. M., & Singh, S. (2010). Exact schedulability analysis of global multi-processor IUF scheduling using symbolic model checking. In 2010 5th International Conference on Industrial and Information Systems, ICIIS 2010 (pp. 281-285). [5578694] https://doi.org/10.1109/ICIINFS.2010.5578694
Lele, Alok ; Kumar, Ajith ; Rohith, H. M. ; Singh, Sanjay. / Exact schedulability analysis of global multi-processor IUF scheduling using symbolic model checking. 2010 5th International Conference on Industrial and Information Systems, ICIIS 2010. 2010. pp. 281-285
@inproceedings{b8ff26a91b0e437c9ef843361e167f4a,
title = "Exact schedulability analysis of global multi-processor IUF scheduling using symbolic model checking",
abstract = "Real time scheduling spans a broad spectrum of algorithms for simple uniprocessors to highly sophisticated multiprocessors. As the world nears the end of Moore's Law, more emphasis is being laid on the use of multi-processors in embedded systems. This has lead to a rise in several new scheduling schemes for multi-processor environments. Naturally there arises a need for an accurate comparison of the schedulabilities of each of these schemes in order to prove their superiority over others. The two-fold aim of this paper is to present a technique for the exact schedulability analysis of global multi-processor schedulers and, based on this intermediary result, prove the schedulability superiority of a novel multi-processor scheduling algorithm. The exact schedulability analysis technique presented here is symbolic model checking in NuSMV, and we have used this technique to investigate the schedulability of global Instantaneous Utilization Factor (IUF) based scheduling. Our analysis shows a substantial improvement in the acceptance of task sets with heavier utilizations.",
author = "Alok Lele and Ajith Kumar and Rohith, {H. M.} and Sanjay Singh",
year = "2010",
month = "11",
day = "2",
doi = "10.1109/ICIINFS.2010.5578694",
language = "English",
isbn = "9781424466535",
pages = "281--285",
booktitle = "2010 5th International Conference on Industrial and Information Systems, ICIIS 2010",

}

Lele, A, Kumar, A, Rohith, HM & Singh, S 2010, Exact schedulability analysis of global multi-processor IUF scheduling using symbolic model checking. in 2010 5th International Conference on Industrial and Information Systems, ICIIS 2010., 5578694, pp. 281-285, 2010 5th International Conference on Industrial and Information Systems, ICIIS 2010, Mangalore, Karnataka, India, 29-07-10. https://doi.org/10.1109/ICIINFS.2010.5578694

Exact schedulability analysis of global multi-processor IUF scheduling using symbolic model checking. / Lele, Alok; Kumar, Ajith; Rohith, H. M.; Singh, Sanjay.

2010 5th International Conference on Industrial and Information Systems, ICIIS 2010. 2010. p. 281-285 5578694.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Exact schedulability analysis of global multi-processor IUF scheduling using symbolic model checking

AU - Lele, Alok

AU - Kumar, Ajith

AU - Rohith, H. M.

AU - Singh, Sanjay

PY - 2010/11/2

Y1 - 2010/11/2

N2 - Real time scheduling spans a broad spectrum of algorithms for simple uniprocessors to highly sophisticated multiprocessors. As the world nears the end of Moore's Law, more emphasis is being laid on the use of multi-processors in embedded systems. This has lead to a rise in several new scheduling schemes for multi-processor environments. Naturally there arises a need for an accurate comparison of the schedulabilities of each of these schemes in order to prove their superiority over others. The two-fold aim of this paper is to present a technique for the exact schedulability analysis of global multi-processor schedulers and, based on this intermediary result, prove the schedulability superiority of a novel multi-processor scheduling algorithm. The exact schedulability analysis technique presented here is symbolic model checking in NuSMV, and we have used this technique to investigate the schedulability of global Instantaneous Utilization Factor (IUF) based scheduling. Our analysis shows a substantial improvement in the acceptance of task sets with heavier utilizations.

AB - Real time scheduling spans a broad spectrum of algorithms for simple uniprocessors to highly sophisticated multiprocessors. As the world nears the end of Moore's Law, more emphasis is being laid on the use of multi-processors in embedded systems. This has lead to a rise in several new scheduling schemes for multi-processor environments. Naturally there arises a need for an accurate comparison of the schedulabilities of each of these schemes in order to prove their superiority over others. The two-fold aim of this paper is to present a technique for the exact schedulability analysis of global multi-processor schedulers and, based on this intermediary result, prove the schedulability superiority of a novel multi-processor scheduling algorithm. The exact schedulability analysis technique presented here is symbolic model checking in NuSMV, and we have used this technique to investigate the schedulability of global Instantaneous Utilization Factor (IUF) based scheduling. Our analysis shows a substantial improvement in the acceptance of task sets with heavier utilizations.

UR - http://www.scopus.com/inward/record.url?scp=77958603468&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77958603468&partnerID=8YFLogxK

U2 - 10.1109/ICIINFS.2010.5578694

DO - 10.1109/ICIINFS.2010.5578694

M3 - Conference contribution

AN - SCOPUS:77958603468

SN - 9781424466535

SP - 281

EP - 285

BT - 2010 5th International Conference on Industrial and Information Systems, ICIIS 2010

ER -

Lele A, Kumar A, Rohith HM, Singh S. Exact schedulability analysis of global multi-processor IUF scheduling using symbolic model checking. In 2010 5th International Conference on Industrial and Information Systems, ICIIS 2010. 2010. p. 281-285. 5578694 https://doi.org/10.1109/ICIINFS.2010.5578694