Compaction of Schedules and a Two-Stage Approach for Duplication-Based DAG Scheduling
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
computer science topics
Active In SP
**

Posts: 610
Joined: Jun 2010
#1
02-07-2010, 06:38 PM


Abstract :-
Many DAG scheduling algorithms generate schedules that require prohibitively large number of processors. To addressthis problem, we propose a generic algorithm, SC, to minimize the processor requirement of any given valid schedule. SC preserves theschedule length of the original schedule and reduces processor count by merging processor schedules and removing redundant
duplicate tasks. To the best of our knowledge, this is the first algorithm to address this highly unexplored aspect of DAG scheduling. Onaverage, SC reduced the processor requirement 91, 82, and 72 percent for schedules generated by PLW, TCSD, and CPFD algorithms,respectively. SC algorithm has a low complexity (OðjN j3Þ) compared to most duplication-based algorithms. Moreover, it decouplesprocessor economization from schedule length minimization problem. To take advantage of these features of SC, we also propose ascheduling algorithm SDS, having the same time complexity as SC. Our experiments demonstrate that schedules generated by SDS areonly 3 percent longer than CPFD (OðjN j4Þ), one of the best algorithms in that respect. SDS and SC together form a two-stage scheduling
algorithm that produces schedules with high quality and low processor requirement, and has lower complexity than the comparablealgorithms that produce similar high-quality results.
Index Terms”Scheduling and task partitioning, task duplication, algorithms, multiprocessor systems
Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
Reply
ajsf06
Active In SP
**

Posts: 2
Joined: Mar 2011
#2
10-03-2011, 10:13 AM

i need algorithm of this project and implimentation.
Reply
ajsf06
Active In SP
**

Posts: 2
Joined: Mar 2011
#3
14-03-2011, 09:09 AM

i need full document of compaction of scheduling
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Message
Type your reply to this message here.


Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Finding a New Approach to Measure the Operational Value of Intelligence for Military seminar flower 66 1,627 30-11-2015, 05:43 PM
Last Post: Guest
  Two Wheels Local Courier System Design Document Report seminar projects maker 0 401 20-09-2013, 04:11 PM
Last Post: seminar projects maker
  Migration of Databases – An XML Approach Abstract seminar projects maker 0 312 19-09-2013, 03:44 PM
Last Post: seminar projects maker
  Educational Multimedia Server – A Java Approach Abstract seminar projects maker 0 438 19-09-2013, 03:41 PM
Last Post: seminar projects maker
  Website in Indian Languages- A Java Approach Abstract seminar projects maker 0 371 19-09-2013, 03:39 PM
Last Post: seminar projects maker
  A Robust Image Watermarking Using Two Level DCT And Wavelet Packet Denoising PPT seminar projects maker 0 456 13-09-2013, 04:56 PM
Last Post: seminar projects maker
  php based project and implimentations project report maker 5 24,878 09-09-2013, 10:04 AM
Last Post: study tips
  Slicing: A new Approach for Privacy Preserving Data Publishing PPT study tips 5 2,232 31-08-2013, 11:58 AM
Last Post: Guest
  Optimal Job Scheduling using Ant Colony Algorithm in Grid Computing PPT study tips 0 398 21-08-2013, 02:49 PM
Last Post: study tips
  A New Approach for Secure Data Transfer based on Wavelet Transform Report study tips 0 399 02-08-2013, 04:15 PM
Last Post: study tips