Advances in Computer Science and Information Technology. Computer Science and Information Technology. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part III

Research Article

Self-configurable Processor Schedule Window Algorithm

Download
233 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-27317-9_42,
        author={A. Rao and A. Govardhan and P. Rao},
        title={Self-configurable Processor Schedule Window Algorithm},
        proceedings={Advances in Computer Science and Information Technology. Computer Science and Information Technology. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part III},
        proceedings_a={CCSIT PART  III},
        year={2012},
        month={11},
        keywords={Scheduling feasibility multiprocessor deadline synchronous free slots sporadic task system},
        doi={10.1007/978-3-642-27317-9_42}
    }
    
  • A. Rao
    A. Govardhan
    P. Rao
    Year: 2012
    Self-configurable Processor Schedule Window Algorithm
    CCSIT PART III
    Springer
    DOI: 10.1007/978-3-642-27317-9_42
A. Rao1,*, A. Govardhan1,*, P. Rao2,*
  • 1: JNTUH
  • 2: IIIT Gouchibowli
*Contact email: adirajupppy@yahoo.com, govardhan_cse@yahoo.co.in, prasad@setusoftware.com

Abstract

Most periodic tasks are assigned to processors using partition scheduling policy after checking feasibility conditions. A new approach is proposed for scheduling aperiodic tasks with periodic task system on multiprocessor system with less number of preemptions. Our approach is self-configurable and adjusts the periodic tasks to the processor such that different types of tasks are scheduled without violating deadline constraints. The new approach proves that when all different types of tasks are scheduled, it leads to better performance.