000200819 001__ 200819
000200819 005__ 20210129215543.0
000200819 037__ $$aFZJ-2015-03204
000200819 0881_ $$aCCSF-44
000200819 088__ $$2Other$$aCCSF-44
000200819 1001_ $$0P:(DE-HGF)0$$aWilliams, Roy$$b0
000200819 245__ $$aOptimization of Output Bandwidth from an Intel Paragon
000200819 260__ $$aPasadena, CA$$bConcurrent Supercomputing Consortium$$c1994
000200819 300__ $$a6 p.
000200819 3367_ $$0PUB:(DE-HGF)29$$2PUB:(DE-HGF)$$aReport$$breport$$mreport$$s1432105081_25976
000200819 3367_ $$2DataCite$$aOutput Types/Report
000200819 3367_ $$2BibTeX$$aTECHREPORT
000200819 3367_ $$2ORCID$$aREPORT
000200819 3367_ $$010$$2EndNote$$aReport
000200819 3367_ $$2DRIVER$$areport
000200819 520__ $$aWe examine the question of how to get maximum output bandwidth from a "real" application running on many nodes of a Paragon. We consider synchronization, flow control, message passing and partition management, and the use of the PARtools performance monitoring and visualization environment to understand and thus optimize these aspects.The application is a "digital VCR": each processor has in memory several compressed video frames, and these are to be decompressed, sent to the Hippi device, and output to a framebuffer at the fastest possible rate. While the Hippi processor is capable of 80 Mbyte/sec, the aggregate bandwidth from the computational processors is 21 Mbyte/sec.In this communication-bound application, we find it optimal to have the communication device (the Hippi processor) to have control, with other processors acting as servers; rather than the processors having distributed control and the Hippi processor acting as server.
000200819 536__ $$0G:(DE-HGF)POF2-899$$a899 - ohne Topic (POF2-899)$$cPOF2-899$$fPOF I$$x0
000200819 7001_ $$0P:(DE-HGF)0$$aNagel, Wolfgang E.$$b1
000200819 773__ $$y1994
000200819 909CO $$ooai:juser.fz-juelich.de:200819$$pVDB
000200819 9132_ $$0G:(DE-HGF)POF3-899$$1G:(DE-HGF)POF3-890$$2G:(DE-HGF)POF3-800$$aDE-HGF$$bForschungsbereich Materie$$lForschungsbereich Materie$$vohne Topic$$x0
000200819 9131_ $$0G:(DE-HGF)POF2-899$$1G:(DE-HGF)POF2-890$$2G:(DE-HGF)POF2-800$$3G:(DE-HGF)POF2$$4G:(DE-HGF)POF$$aDE-HGF$$bProgrammungebundene Forschung$$lohne Programm$$vohne Topic$$x0
000200819 920__ $$lyes
000200819 9201_ $$0I:(DE-Juel1)JSC-20090406$$kJSC$$lJülich Supercomputing Center$$x0
000200819 9201_ $$0I:(DE-Juel1)VDB62$$kZAM$$lZentralinstitut für Angewandte Mathematik$$x1
000200819 980__ $$areport
000200819 980__ $$aVDB
000200819 980__ $$aI:(DE-Juel1)JSC-20090406
000200819 980__ $$aI:(DE-Juel1)VDB62
000200819 980__ $$aUNRESTRICTED
000200819 981__ $$aI:(DE-Juel1)VDB62