Abstract

Fine-grained multithreaded models can provide more opportunities for system performance improvements, but they face large amount of communication overhead. To reduce the communication overhead to improve performance, message aggregation and communication pipeline have been proposed and their advantages have been discussed in previous works. However, when exploiting them in real-life applications, it is challenging to maximize their advantages due to their unrevealed problems. This paper investigates the two communication optimization techniques from the view of their problems to fulfill the studies. We have found that when applying the techniques, message aggregation may have the deadlock problem and latency problem, and communication pipeline may face the ineffective problem and prolog and epilog problem. Based on the basic requirement of allocating the two techniques on an initial schedule, we then present general solutions to avoid or handle the problems. To obtain a minimum schedule length for an initial schedule, we further develop a binary particle swarm optimization-based fine-grained communication optimization method to allocate message aggregation and communication pipeline for best performance. The method is also integrated into light and efficient simulink compiler for embedded application multithreaded code generator to generate high quality codes. Experimental results on both synthetic and real-life applications demonstrate the efficiency of the proposed method.

Full Text
Paper version not known

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 call

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.