Skip to main content

2018 | OriginalPaper | Buchkapitel

Revisiting Flynn’s Classification: The Portfolio Approach

verfasst von : Yanik Ngoko, Denis Trystram

Erschienen in: Euro-Par 2017: Parallel Processing Workshops

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.
If we want to continue to solve hard computational problems, the only way is to change the way problems are solved. In this work, we propose to investigate how algorithms portfolio may be a direction to solve hard and large problems. It is also the occasion for us to revisit the well-known Flynn’s classification and clarifying the MISD (Multiple Instructions Single Data) class which was never really well-understood.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
Flynn introduced his taxonomy with the notion of ‘organization’. But, in his latter work [8], he also used the term of ‘parallel machine architectures’. Our position is that an organization is a generic concept that could or not be realized with a computer architecture.
 
2
In this paper, we assume common layered computer architectures: hardware, operating system and applications.
 
4
Such values are often formulated under the umbrella term of capping conditions.
 
5
 
6
Most multicore systems are based on a NUMA architecture.
 
Literatur
1.
Zurück zum Zitat Bougeret, M., Dutot, P., Goldman, A., Ngoko, Y., Trystram, D.: Combining multiple heuristics on discrete resources. In: 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, 23–29 May 2009, pp. 1–8. IEEE (2009) Bougeret, M., Dutot, P., Goldman, A., Ngoko, Y., Trystram, D.: Combining multiple heuristics on discrete resources. In: 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, 23–29 May 2009, pp. 1–8. IEEE (2009)
2.
Zurück zum Zitat Bougeret, M., Dutot, P., Goldman, A., Ngoko, Y., Trystram, D.: Approximating the discrete resource sharing scheduling problem. Int. J. Found. Comput. Sci. 22(3), 639–656 (2011)MathSciNetCrossRefMATH Bougeret, M., Dutot, P., Goldman, A., Ngoko, Y., Trystram, D.: Approximating the discrete resource sharing scheduling problem. Int. J. Found. Comput. Sci. 22(3), 639–656 (2011)MathSciNetCrossRefMATH
3.
Zurück zum Zitat Bovet, D., Cesati, M.: Understanding the Linux Kernel. Oreilly & Associates Inc., Sebastopol (2005) Bovet, D., Cesati, M.: Understanding the Linux Kernel. Oreilly & Associates Inc., Sebastopol (2005)
4.
Zurück zum Zitat Darema, F., George, D., Norton, V., Pfister, G.: A single-program-multiple-data computational model for EPEX/FORTRAN. Parallel Comput. 7(1), 11–24 (1988)CrossRefMATH Darema, F., George, D., Norton, V., Pfister, G.: A single-program-multiple-data computational model for EPEX/FORTRAN. Parallel Comput. 7(1), 11–24 (1988)CrossRefMATH
5.
Zurück zum Zitat Diderot, D., le Rond d’Alembert, J., (eds.): Encyclopédie, ou dictionnaire raisonné des sciences, des arts et des métiers. André le Breton, Michel-Antoine David, Laurent Durand and Antoine-Claude Briasson, France (1751–1766) Diderot, D., le Rond d’Alembert, J., (eds.): Encyclopédie, ou dictionnaire raisonné des sciences, des arts et des métiers. André le Breton, Michel-Antoine David, Laurent Durand and Antoine-Claude Briasson, France (1751–1766)
6.
Zurück zum Zitat Feng, T.Y.: Some characteristics of associative parallel processing. In: Proceedings of the 1972 Sagamore Computing Conference, pp. 5–16 (1972) Feng, T.Y.: Some characteristics of associative parallel processing. In: Proceedings of the 1972 Sagamore Computing Conference, pp. 5–16 (1972)
7.
Zurück zum Zitat Flynn, M.J.: Some computer organizations and their effectiveness. IEEE Trans. Comput. 21(9), 948–960 (1972)CrossRefMATH Flynn, M.J.: Some computer organizations and their effectiveness. IEEE Trans. Comput. 21(9), 948–960 (1972)CrossRefMATH
8.
Zurück zum Zitat Flynn, M.J., Rudd, K.W.: Parallel architectures. ACM Comput. Surv. 28(1), 67–70 (1996)CrossRef Flynn, M.J., Rudd, K.W.: Parallel architectures. ACM Comput. Surv. 28(1), 67–70 (1996)CrossRef
9.
Zurück zum Zitat Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)MATH Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)MATH
10.
Zurück zum Zitat Händler, W.: The impact of classification schemes on computer architecture. In: Agrawal, D.P. (ed.) Advanced Computer Architecture, pp. 3–11. IEEE Computer Society Press, Los Alamitos (1986) Händler, W.: The impact of classification schemes on computer architecture. In: Agrawal, D.P. (ed.) Advanced Computer Architecture, pp. 3–11. IEEE Computer Society Press, Los Alamitos (1986)
11.
Zurück zum Zitat Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 275(5296), 51–54 (1997)CrossRef Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 275(5296), 51–54 (1997)CrossRef
12.
Zurück zum Zitat Lameter, C.: Numa (non-uniform memory access): an overview. Queue 11(7), 40:40–40:51 (2013)CrossRef Lameter, C.: Numa (non-uniform memory access): an overview. Queue 11(7), 40:40–40:51 (2013)CrossRef
13.
Zurück zum Zitat Null, L., Lobur, J.: Essentials of Computer Organization and Architecture, 3rd edn. Jones and Bartlett Publishers, Inc., USA (2010) Null, L., Lobur, J.: Essentials of Computer Organization and Architecture, 3rd edn. Jones and Bartlett Publishers, Inc., USA (2010)
14.
Zurück zum Zitat Streeter, M.J., Golovin, D., Smith, S.F.: Combining multiple heuristics online. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 22–26 July 2007, Vancouver, British Columbia, Canada, pp. 1197–1203 (2007) Streeter, M.J., Golovin, D., Smith, S.F.: Combining multiple heuristics online. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 22–26 July 2007, Vancouver, British Columbia, Canada, pp. 1197–1203 (2007)
15.
Zurück zum Zitat Thurlow, R.: RPC: remote procedure call protocol specification version 2. Technical report, Sun Microsystems (2009) Thurlow, R.: RPC: remote procedure call protocol specification version 2. Technical report, Sun Microsystems (2009)
16.
Zurück zum Zitat Vardi, M.Y.: Moore’s law and the sand-heap paradox. Commun. ACM 57(5), 5 (2014)CrossRef Vardi, M.Y.: Moore’s law and the sand-heap paradox. Commun. ACM 57(5), 5 (2014)CrossRef
Metadaten
Titel
Revisiting Flynn’s Classification: The Portfolio Approach
verfasst von
Yanik Ngoko
Denis Trystram
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-75178-8_19

Neuer Inhalt