Earticle

초록

영어

Now a days Jobs are Scheduled in a single processor or more than one processor, a real time job is scheduled or executed based on requirements, An Successful task in embedded system ought to have constrained asset necessities: Memory, execution time and power utilization, these necessity are not generally simple to fulfil in real-time embedded system with hard task deadlines. In this paper we explore the effective time utilization, without influencing the deadline requirements of typical hard real time task ,there are no limitation on the new results each task can be periodic or sporadic ,with relative deadline which can be less than ,equivalent to or greater than its period, it is too fast , best-effort ,effective real time scheduling algorithm for a wide variety of job parameters.

목차

Abstract
 1. Introduction
 2. Basics
  2.1. Clock Driven Scheduling
  2.2. Round Robin Scheduling
  2.3. Weighted Round Robin
  2.4. Priority Driven Approach
 3. Scheduling Algorithm
  3.1. In A Single System Based On Minimum 2 To 3 Priority Schedule:
  3.2. Multiple Jobs in 2 Processors:
 4. Evaluation
  4.1. Theorem1:
  4.2. Theorem 2:
 5. Conclusion
 References

키워드

저자

• J. V. N. Ramesh [ Dept. of Electronics and computer Engineering K. L. University ]
• B. Naresh Kumar Reddy [ Dept. of Electronics and computer Engineering K. L. University ]
• V. V. Murali Krishna [ Dept. of Electronics and computer Engineering K. L. University ]
• B. M. Kumar Gandhi [ Dept. of Electronics and computer Engineering K. L. University ]
• V. Shiva [ Dept. of Electronics and computer Engineering K. L. University ]
• M. Dronika Devi [ Dept. of Electronics and computer Engineering K. L. University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Smart Home

• 간기

  격월간

• pISSN

  1975-4094

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605