论文信息 - Revisiting Flynn's Classification: The Portfolio Approach

Revisiting Flynn's Classification: The Portfolio Approach

Today, we are reaching the limits of Moore’s law: the progress of parallel components does not grow exponentially as it did continuously during the last decades. This is somehow a paradox since the computing platforms are always more powerful. It simply tells us that the efficiency of parallel programs is becoming less obvious.

Denis Trystram | Yanik Ngoko

[1] Linda Null,et al. The essentials of computer organization and architecture , 2003 .

[2] Marin Bougeret,et al. Approximating the Discrete Resource Sharing Scheduling Problem , 2011, Int. J. Found. Comput. Sci..

[3] Marin Bougeret,et al. Combining multiple heuristics on discrete resources , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5] Michael J. Flynn,et al. Parallel architectures , 1996, CSUR.

[6] Moshe Y. Vardi. Moore's law and the sand-heap paradox , 2014, CACM.

[7] Frederica Darema,et al. A single-program-multiple-data computational model for EPEX/FORTRAN , 1988, Parallel Comput..

[8] Michael J. Flynn,et al. Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.

[9] Robert Thurlow,et al. RPC: Remote Procedure Call Protocol Specification Version 2 , 2009, RFC.

[10] Daniel Pierre Bovet,et al. Understanding the Linux Kernel , 2000 .

[11] Christoph Lameter,et al. NUMA (Non-Uniform Memory Access): An Overview , 2013, ACM Queue.

[12] W Händler,et al. The impact of classification schemes on computer architecture , 1986 .

[13] Tad Hogg,et al. An Economics Approach to Hard Computational Problems , 1997, Science.