File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Spatial and temporal data parallelization of the H.261 video coding algorithm

TitleSpatial and temporal data parallelization of the H.261 video coding algorithm
Authors
Issue Date2001
PublisherIEEE.
Citation
Ieee Transactions On Circuits And Systems For Video Technology, 2001, v. 11 n. 1, p. 91-104 How to Cite?
AbstractIn this paper, the parallelization of the H.261 video coding algorithm on the IBM SP2 multiprocessor system is described. The effect of parallelizing computations and communications in the spatial, temporal, and both spatial-temporal domains are considered through the study of frame rate, speedup, and implementation efficiency, which are modeled and measured with respect to the number of nodes (n) and parallel methods used. Four parallel algorithms were developed, of which the first two exploited the spatial parallelism in each frame, and the last two exploited both the temporal and spatial parallelism over a sequence of frames. The two spatial algorithms differ in that one utilizes a single communication master, while the other attempts to distribute communications across three masters. On the other hand, the spatial-temporal algorithms use a pipeline structure for exploiting the temporal parallelism together with either a single master or multiple masters. The best median speedup (frame rate) achieved was close to 15[15 frames per second (fps)] for 352 × 240 video on 24 nodes, and 13 (37 fps) for QCIF video, by the spatial algorithm with distributed communications. For n < 10, the single-master spatial algorithm performs better with efficiency up to 90%, while the multiple-master spatial algorithm is superior for n > 10, with efficiency up to 70%. The spatial-temporal algorithms achieved average speedup performance, but are most scalable for large n.
Persistent Identifierhttp://hdl.handle.net/10722/42871
ISSN
2015 Impact Factor: 2.254
2015 SCImago Journal Rankings: 1.606
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorYung, NHCen_HK
dc.contributor.authorLeung, KKen_HK
dc.date.accessioned2007-03-23T04:33:46Z-
dc.date.available2007-03-23T04:33:46Z-
dc.date.issued2001en_HK
dc.identifier.citationIeee Transactions On Circuits And Systems For Video Technology, 2001, v. 11 n. 1, p. 91-104en_HK
dc.identifier.issn1051-8215en_HK
dc.identifier.urihttp://hdl.handle.net/10722/42871-
dc.description.abstractIn this paper, the parallelization of the H.261 video coding algorithm on the IBM SP2 multiprocessor system is described. The effect of parallelizing computations and communications in the spatial, temporal, and both spatial-temporal domains are considered through the study of frame rate, speedup, and implementation efficiency, which are modeled and measured with respect to the number of nodes (n) and parallel methods used. Four parallel algorithms were developed, of which the first two exploited the spatial parallelism in each frame, and the last two exploited both the temporal and spatial parallelism over a sequence of frames. The two spatial algorithms differ in that one utilizes a single communication master, while the other attempts to distribute communications across three masters. On the other hand, the spatial-temporal algorithms use a pipeline structure for exploiting the temporal parallelism together with either a single master or multiple masters. The best median speedup (frame rate) achieved was close to 15[15 frames per second (fps)] for 352 × 240 video on 24 nodes, and 13 (37 fps) for QCIF video, by the spatial algorithm with distributed communications. For n < 10, the single-master spatial algorithm performs better with efficiency up to 90%, while the multiple-master spatial algorithm is superior for n > 10, with efficiency up to 70%. The spatial-temporal algorithms achieved average speedup performance, but are most scalable for large n.en_HK
dc.format.extent395406 bytes-
dc.format.extent5183 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofIEEE Transactions on Circuits and Systems for Video Technologyen_HK
dc.rights©2001 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.titleSpatial and temporal data parallelization of the H.261 video coding algorithmen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1051-8215&volume=11&issue=1&spage=91&epage=104&date=2001&atitle=Spatial+and+temporal+data+parallelization+of+the+H.261+video+coding+algorithmen_HK
dc.identifier.emailYung, NHC:nyung@eee.hku.hken_HK
dc.identifier.authorityYung, NHC=rp00226en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/76.894289en_HK
dc.identifier.scopuseid_2-s2.0-0035108580en_HK
dc.identifier.hkuros59373-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0035108580&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume11en_HK
dc.identifier.issue1en_HK
dc.identifier.spage91en_HK
dc.identifier.epage104en_HK
dc.identifier.isiWOS:000166439700008-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridYung, NHC=7003473369en_HK
dc.identifier.scopusauthoridLeung, KK=35779695300en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats