Abstract
Heuristic methods are proposed for assigning a set of soft tasks to a set of PEs (processing elements) in such a way that the set of tasks has a minimum execution time. The objective is to try to meet the performance requirements of applications, especially of real-time applications. Emphasis is placed on specific applications where there are more PEs than active tasks. Two criteria are proposed to measure the quality of an interconnection for these applications. A simple grain-size decision algorithm that groups tasks that communicate with each other into one node is presented. >
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 callDisclaimer: 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.
