File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Novel neighborhood search for multiprocessor scheduling with pipelining

TitleNovel neighborhood search for multiprocessor scheduling with pipelining
Authors
KeywordsData Flow Graph
Interprocessor Communication
Multiprocessor Scheduling
Neighborhood Search
Pipelining
Issue Date2002
PublisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc
Citation
Journal Of Parallel And Distributed Computing, 2002, v. 62 n. 1, p. 85-110 How to Cite?
AbstractThis 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. © 2001 Elsevier Science.
Persistent Identifierhttp://hdl.handle.net/10722/155161
ISSN
2015 Impact Factor: 1.32
2015 SCImago Journal Rankings: 0.851
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLeung, KKen_US
dc.contributor.authorYung, NHCen_US
dc.contributor.authorCheung, PYSen_US
dc.date.accessioned2012-08-08T08:32:08Z-
dc.date.available2012-08-08T08:32:08Z-
dc.date.issued2002en_US
dc.identifier.citationJournal Of Parallel And Distributed Computing, 2002, v. 62 n. 1, p. 85-110en_US
dc.identifier.issn0743-7315en_US
dc.identifier.urihttp://hdl.handle.net/10722/155161-
dc.description.abstractThis 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. © 2001 Elsevier Science.en_US
dc.languageengen_US
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdcen_US
dc.relation.ispartofJournal of Parallel and Distributed Computingen_US
dc.subjectData Flow Graphen_US
dc.subjectInterprocessor Communicationen_US
dc.subjectMultiprocessor Schedulingen_US
dc.subjectNeighborhood Searchen_US
dc.subjectPipeliningen_US
dc.titleNovel neighborhood search for multiprocessor scheduling with pipeliningen_US
dc.typeArticleen_US
dc.identifier.emailYung, NHC:nyung@eee.hku.hken_US
dc.identifier.emailCheung, PYS:paul.cheung@hku.hken_US
dc.identifier.authorityYung, NHC=rp00226en_US
dc.identifier.authorityCheung, PYS=rp00077en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1006/jpdc.2001.1779en_US
dc.identifier.scopuseid_2-s2.0-0036183707en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0036183707&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume62en_US
dc.identifier.issue1en_US
dc.identifier.spage85en_US
dc.identifier.epage110en_US
dc.identifier.isiWOS:000173951200005-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridLeung, KK=35779695300en_US
dc.identifier.scopusauthoridYung, NHC=7003473369en_US
dc.identifier.scopusauthoridCheung, PYS=7202595335en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats