A language for the complexity analysis of parallel programs

DOI10.1007/3-540-48086-2_28MaRDI QIDQ4737367zbMATH OpenFDO

Authors Jesus A. Gonzalez, Coromoto León, M. Pristinta, J. L. Roda, C. Rodríguez, Jose M. Rodriguez, F. Sande

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2328/23280256.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• BSP versus LogP
• A new parallel model for the analysis of asynchronous algorithms
• scientific article; zbMATH DE number 800569
• Direct bulk-synchronous parallel algorithms
• Performance prediction of oblivious BSP programs

Cited in

(7)

• A generalized language of parallel compositions
• A generic cost model for concurrent and data-parallel meta-computing
• scientific article; zbMATH DE number 3907747 (Why is no real title available?)
• Some remarks on networks of parallel language processors
• Measuring the performance impact of SP-restricted programming in shared-memory machines
• Performance prediction of oblivious BSP programs
• scientific article; zbMATH DE number 7260573 (Why is no real title available?)

This page was built for publication: A language for the complexity analysis of parallel programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737367)