Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30063
Architecture Based on Dynamic Graphs for the Dynamic Reconfiguration of Farms of Computers

Authors: Carmen Navarrete, Eloy Anguiano

Abstract:

In the last years, the computers have increased their capacity of calculus and networks, for the interconnection of these machines. The networks have been improved until obtaining the actual high rates of data transferring. The programs that nowadays try to take advantage of these new technologies cannot be written using the traditional techniques of programming, since most of the algorithms were designed for being executed in an only processor,in a nonconcurrent form instead of being executed concurrently ina set of processors working and communicating through a network.This paper aims to present the ongoing development of a new system for the reconfiguration of grouping of computers, taking into account these new technologies.

Keywords: Dynamic network topology, resource and task allocation, parallel computing, heterogeneous computing, dynamic reconfiguration.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1077477

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF

References:


[1] R. Canal, J.M.l Parcerisa, and A. Gonzalez. Dynamic cluster assignment mechanisms. In HPCA, pages 133-, 2000.
[2] R. Bhargava and L. John. Improving dynamic cluster assignment for clustered trace cache processors. Technical report, 2003.
[3] K. Amiri, D. Petrou, G. Ganger, and G. Gibson. Dynamic function placement in active storage clusters. Technical report, 1999.
[4] A. Lastovetsky. Scientific programming for heterogeneus systems - bridging the gap between algorithms and applications. In PARELEC-06 IEEE Proceedings, pages 3-8, 2006.
[5] A. Lastovetsky and R Reddy. HeteroMPI: Towards a message-passing library for heterogeneous networks of computers. Journal of Parallel and Distributed Computing, 2005.
[6] M.O. Ball. Computing network reliability. 1979.
[7] J.S. Provan and M.O. Ball. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal on Computing, (12):777 - 788, 1983.
[8] J.Dongarra and A. Lastovetsky. An overview of heterogeneous high performance and grid computing. American Scientific Publishers, 2006.
[9] David A. Bacigalupo, Stephen A. Jarvis, Ligang He, Daniel P. Spooner, and Graham R. Nudd. Comparing layered queuing and historical performance models of a distributed enterprise application. In IASTED International Conference on Parallel and Distributed Computing and Networks, pages 608-613, 2005.
[10] David A. Bacigalupo, Stephen A. Jarvis, Ligang He, D. Spooner, D. Pelych, and Graham R. Nudd. A comparative evaluation of two techniques for predicting the performance of dynamic enterprise systems. In PARCO, pages 163-170, 2005.
[11] L. Kleinrock. Queuing Systems: Theory. Wiley, 1975.
[12] Bassel R. Arafeh, Khaled Day, and Abderezak Touzene. A paradigm for allocating parallel application tasks to heterogeneous computing resources on the grid. In PARCO, pages 41-48, 2005.
[13] B. Song, C. Ernemann, and R. Yahyapour. Parallel computer workload modeling with markov chains. In Proceedings of the 10th Job Scheduling Strategies for Parallel Processing (JSSPP), volume 3277, pages 47-62. Lecture Notes in Computer Science, Springer-Verlag, 2004.
[14] D. Gross and C.M. Harris. Fundamentals on Queuing Theory. Wiley, 1998.
[15] Edsger. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
[16] Richard Bellman. On a routing problem. Quarterly of Applied Mathematics, 16(1):87 - 90, 1958.