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@gmail.com
Hyperbolic Utilization Bounds for Rate Monotonic Scheduling
on Homogeneous Multiprocessors
Abstract
The utilization bounds for partitioned multiprocessor scheduling are a function of task allocation
algorithms and the schedulability conditions selected for uniprocessor scheduling algorithms. In this
paper, we use rate-monotonic scheduling on each processor and present the lower and upper limits of
the utilization bounds for all reasonable task allocation heuristics. Unlike previous work, the hyperbolic
bound due to Bini , instead of the Liu & Layland bound, is adopted to do the schedulability test on
uniprocessors. We also derive the utilization bounds with respect to the worst fit allocation algorithm
and reasonable allocation decreasing heuristics, and the two bounds are found to coincide with the
worst and best achievable multiprocessor utilization bounds, respectively. Analytical and experimental
results show that the proposed utilization bound performs better than the existing bound under quite a
lot of parameter settings, and combining these two bounds together can significantly (up to 3 times)
increase the number of schedulable task sets with little extra overhead.
Existing system
The utilization bounds for partitioned multiprocessor scheduling are a function of task allocation
algorithms and the schedulability conditions selected for uniprocessor scheduling algorithms
Proposed system
we use rate-monotonic scheduling on each processor and present the lower and upper limits of the
utilization bounds for all reasonable task allocation heuristics. Unlike previous work, the hyperbolic
bound due to Bini , instead of the Liu & Layland bound, is adopted to do the schedulability test on
uniprocessors. We also derive the utilization bounds with respect to the worst fit allocation algorithm

2. and reasonable allocation decreasing heuristics, and the two bounds are found to coincide with the
worst and best achievable multiprocessor utilization bounds, respectively. Analytical and experimental
results show that the proposed utilization bound performs better than the existing bound under quite a
lot of parameter settings, and combining these two bounds together can significantly (up to 3 times)
increase the number of schedulable task sets with little extra overhead.
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.