دورية أكاديمية

Parallel implementation of Lemke's algorithm on the hypercube

التفاصيل البيبلوغرافية
العنوان: Parallel implementation of Lemke's algorithm on the hypercube
المؤلفون: DE LEONE, Renato, Ow Terence T. H.
المساهمون: DE LEONE, Renato, Ow Terence, T. H.
سنة النشر: 1991
المجموعة: CAMPUS Pubblicazioni Scientifiche Unicam (Università di Camerino)
مصطلحات موضوعية: Mathematical Technique, Hypercubes, Lemke's algorithm, Computer Programming
الوصف: A simple but very effective method for parallelizing Lemke's algorithm for the solution of linear complementarity problems is presented. Implementation details on a 32-node Intel iPSC/2 hypercube for problems of dimension up to 1000 are discussed. A speedup efficiency as high as 76% is achieved with 32 processing nodes for a problem with 500 variables and 250,000 nonzero elements. By combining the effects of concurrency and vectorization the computing time on the Intel iPSC/2 in some cases is reduced by a factor of 100.
نوع الوثيقة: article in journal/newspaper
اللغة: English
العلاقة: volume:3; issue:1; firstpage:56; lastpage:62; numberofpages:6; journal:ORSA JOURNAL ON COMPUTING; http://hdl.handle.net/11581/241412Test; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-0026389931; http://www.scopus.com/inward/record.url?eid=2-s2.0-0026389931&partnerID=40&md5=0049568ec576ccf8e2574e6908df37f3Test
الإتاحة: http://hdl.handle.net/11581/241412Test
http://www.scopus.com/inward/record.url?eid=2-s2.0-0026389931&partnerID=40&md5=0049568ec576ccf8e2574e6908df37f3Test
رقم الانضمام: edsbas.39882944
قاعدة البيانات: BASE