To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

1. GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmai l.com
Harmonic-Aware Multi-Core Scheduling for Fixed-Priority
Real-Time Systems
Abstract
This paper presents a new semi partitioned approach to schedule sporadic tasks on multicore platforms
based on the Rate Monotonic Scheduling policy. To improve the schedulability, our approach exploits
the fact that the utilization bound of a task set increases as task periods become closer to harmonic on
single processor platforms. The challenge for our approach, however, is how to take advantage of this
fact to assign and split appropriate tasks on different processors in the semipartitioned approach, and
how to guarantee the schedulability of real-time tasks. We formally prove that our scheduling approach
can successfully schedule any task set with a system utilization bounded by Liu&Layland's bound for N
tasks, that is, N(21/N - 1). Our extensive experimental results demonstrate that the proposed algorithm
can significantly improve the scheduling performance compared with the previous work.
Existing system
This paper presents a new semi partitioned approach to schedule sporadic tasks on multicore platforms
based on the Rate Monotonic Scheduling policy. To improve the schedulability, our approach exploits
the fact that the utilization bound of a task set increases as task periods become closer to harmonic on
single processor platforms. The challenge for our approach, however, is how to take advantage of this
fact to assign and split appropriate tasks on different processors in the semipartitioned approach, and
how to guarantee the schedulability of real-time tasks

2. Proposed system
We formally prove that our scheduling approach can successfully schedule any task set with a system
utilization bounded by Liu&Layland's bound for N tasks, that is, N(21/N - 1). Our extensive experimental
results demonstrate that the proposed algorithm can significantly improve the scheduling performance
compared with the previous work.
SYSTEM CONFIGURATION:-
HARDWARE CONFIGURATION:-
 Processor - Pentium –IV
 Speed - 1.1 Ghz
 RAM - 256 MB(min)
 Hard Disk - 20 GB
 Key Board - Standard Windows Keyboard
 Mouse - Two or Three Button Mouse
 Monitor - SVGA
SOFTWARE CONFIGURATION:-
 Operating System : Windows XP
 Programming Language : JAVA
 Java Version : JDK 1.6 & above.