Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Reclaiming Spare Capacity and Improving Aperiodic Response Times in Real-Time Environments | Hindawi Publishing Corporation EURASIP Journal on Embedded Systems Volume 2011 Article ID391215 18 pages doi 2011 391215 Research Article Reclaiming Spare Capacity and Improving Aperiodic Response Times in Real-Time Environments Sathish Gopalakrishnan1 and Xue Liu2 1 Department of Electrical and Computer Engineering the University of British Columbia 2332 Main Mall Vancouver BC Canada V6T1Z4 2 Department of Computer Science and Engineering University of Nebraska-Lincoln 104 Schorr Center Lincoln NE 68588 USA Correspondence should be addressed to Sathish Gopalakrishnan sathish@ Received 30 August 2010 Accepted 28 January 2011 Academic Editor S. Ramesh Copyright 2011 S. Gopalakrishnan and X. Liu. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. Scheduling recurring task sets that allow some instances of the tasks to be skipped produces holes in the schedule which are nonuniformly distributed. Similarly when the recurring tasks are not strictly periodic but are sporadic there is extra processor bandwidth arising because of irregular job arrivals. The additional computation capacity that results from skips or sporadic tasks can be reclaimed to service aperiodic task requests efficiently and quickly. We present techniques for improving the response times of aperiodic tasks by identifying nonuniformly distributed spare capacity because of skips or sporadic tasks in the schedule and adding such extra capacity to the capacity queue of a BASH server. These gaps can account for a significant portion of aperiodic capacity and their reclamation results in considerable improvement to aperiodic response times. We present two schemes NCLB-CBS which performs well in periodic real-time environments with firm tasks and NCLB-CUS which can be deployed when the basic task set to schedule is sporadic. .
