首页 | 本学科首页   官方微博 | 高级检索  
     


Novel Neighborhood Search for Multiprocessor Scheduling with Pipelining
Affiliation:1. National Research Council of Italy, Institute of Methodologies for Environmental Analysis CNR-IMAA, Potenza, Italy;2. Reload Srl Via Turati 32, 20121, Milano, Italy;3. SolEthEn, Viale Del Seminario Maggiore 37, 85100, Potenza, Italy;1. Chair of Renewable and Sustainable Energy Systems, Technical University of Munich, Germany;2. Ifo Institute for Economic Research at the University of Munich, Germany;3. Institute of Energy Economics and Department of Economics, University of Cologne, Germany;4. Institute of Energy Economics and Rational Energy Use (IER), University of Stuttgart, Germany;5. Institute for Future Energy Consumer Needs and Behavior (FCN), School of Business and Economics / E.ON Energy Research Center, RWTH Aachen University, Germany
Abstract:This paper presents a neighborhood search algorithm for heterogeneous multiprocessor scheduling in which loop pipelining is used to exploit parallelism between iterations. The method adopts a realistic model for interprocessor communication where resource contention is taken into consideration. The schedule representation scheme is flexible so that communication scheduling can be performed in a generic manner. Base on a general time formulation of the schedule performance, the algorithm improves an initial schedule in an efficient way by successive modification to the task processor mapping and task ordering. Simulation results show that significant improvement over existing methods can be obtained. A parallel software video encoder was implemented based on the scheduling result and real time performance was achieved with pipelining of frame encoding.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号