Show simple item record

dc.contributor.authorWeimar, Joerg Richarden_US
dc.date.accessioned2013-06-19T14:36:28Z
dc.date.available2013-06-19T14:36:28Z
dc.date.issued1990
dc.identifierhttp://eprints.cs.vt.edu/archive/00000196/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19604
dc.description.abstractA comparison between sequential code and vectorization code for matrix multiplication is made and the possible ways to vectorize matrix multiplication are examined. The result is that vectorization of the correct loop results in a speedup of almost 3 for vectors that are long enough, i.e., longer than or equal to half the vector length of the machine. The number and order of memory references is a very important factor.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleVectorization Experiment on the IBM 3090 Vector Facilityen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-90-14en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000196/01/TR-90-14.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record