File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Novel neighborhood search for multiprocessor scheduling with pipelining

TitleNovel neighborhood search for multiprocessor scheduling with pipelining
Authors
Issue Date2000
PublisherIEEE.
Citation
The 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region Proceedings, Beijing, China, 14-17 May 2000, v. 1, p. 296-301 How to Cite?
AbstractPresents 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. Based on a general time formulation of the schedule performance, the algorithm improves an initial schedule in an efficient way. Experimental results show that significant improvement over existing methods can be obtained. Using the scheduling results, a parallel software video encoder was implemented and real-time performance was achieved.
Persistent Identifierhttp://hdl.handle.net/10722/46177
ISBN

 

DC FieldValueLanguage
dc.contributor.authorLeung, KKen_HK
dc.contributor.authorYung, NHCen_HK
dc.contributor.authorCheung, PYSen_HK
dc.date.accessioned2007-10-30T06:44:10Z-
dc.date.available2007-10-30T06:44:10Z-
dc.date.issued2000en_HK
dc.identifier.citationThe 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region Proceedings, Beijing, China, 14-17 May 2000, v. 1, p. 296-301en_HK
dc.identifier.isbn0-7695-0589-2en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46177-
dc.description.abstractPresents 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. Based on a general time formulation of the schedule performance, the algorithm improves an initial schedule in an efficient way. Experimental results show that significant improvement over existing methods can be obtained. Using the scheduling results, a parallel software video encoder was implemented and real-time performance was achieved.en_HK
dc.format.extent681754 bytes-
dc.format.extent4863 bytes-
dc.format.extent10863 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofInternational Conference/Exhibition on High Performance Computing in the Asia-Pacific Region Proceedings-
dc.rights©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleNovel neighborhood search for multiprocessor scheduling with pipeliningen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0-7695-0589-2&volume=1&spage=296&epage=301&date=2000&atitle=Novel+neighborhood+search+for+multiprocessor+scheduling+with+pipeliningen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/HPC.2000.846565en_HK
dc.identifier.hkuros51356-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats