Abstract
Parallax, a scheduling tool that incorporates seven traditional and nontraditional scheduling heuristics and lets developers compare their performance for real applications on real parallel machines, is discussed. Of the seven heuristics, two simple ones consider only task execution time, two consider both task execution and message-passing delay times, two use task duplication to reduce communication delay, and one considers communication delays, task execution time, and target machine characteristics such as interconnection network topology and overhead due to message-passing and process creation. Two examples of parallel applications of Parallax are described. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Parallel & Distributed Technology: Systems & Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
