File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Parallelization of the H.261 video coding algorithm on the IBM SP2(R) multiprocessor system

TitleParallelization of the H.261 video coding algorithm on the IBM SP2(R) multiprocessor system
Authors
Issue Date1997
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000029
Citation
The 3rd International Conference on Algorithms and Architectures for Parallel Processing, Melbourne, Vic., Australia, 10-12 December 1997, p. 571-578 How to Cite?
AbstractIn this paper, the parallelization of the H.261 video coding algorithm on the IBM SP2 multiprocessor system is described. Based on domain decomposition as a framework, data partitioning, data dependencies and communication issues are carefully assessed. From these, two parallel algorithms were developed with the first one maximizes on processor utilization and the second one minimizes on communications. Our analysiis shows that the first algorithm exhibits poor scalability and high communication overhead; and the second algorithm exhibits good scalability and low communication overhead. A best median speed up of 13.72 or 11 frameskec was achieved on 24 processors.
Persistent Identifierhttp://hdl.handle.net/10722/46066

 

DC FieldValueLanguage
dc.contributor.authorYung, NHCen_HK
dc.contributor.authorLeung, KKen_HK
dc.date.accessioned2007-10-30T06:41:48Z-
dc.date.available2007-10-30T06:41:48Z-
dc.date.issued1997en_HK
dc.identifier.citationThe 3rd International Conference on Algorithms and Architectures for Parallel Processing, Melbourne, Vic., Australia, 10-12 December 1997, p. 571-578en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46066-
dc.description.abstractIn this paper, the parallelization of the H.261 video coding algorithm on the IBM SP2 multiprocessor system is described. Based on domain decomposition as a framework, data partitioning, data dependencies and communication issues are carefully assessed. From these, two parallel algorithms were developed with the first one maximizes on processor utilization and the second one minimizes on communications. Our analysiis shows that the first algorithm exhibits poor scalability and high communication overhead; and the second algorithm exhibits good scalability and low communication overhead. A best median speed up of 13.72 or 11 frameskec was achieved on 24 processors.en_HK
dc.format.extent532731 bytes-
dc.format.extent10863 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000029en_HK
dc.rights©1997 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.titleParallelization of the H.261 video coding algorithm on the IBM SP2(R) multiprocessor systemen_HK
dc.typeConference_Paperen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICAPP.1997.651523en_HK
dc.identifier.hkuros36832-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats