Title :
On the scalability of centralized control
Author :
Feitelson, Dror G.
Author_Institution :
Dept. of Comput. Sci. & Eng., Hebrew Univ., Jerusalem, Israel
Abstract :
Scalability of clusters and MPPs is typically discussed in terms of limits on growth: something which grows at a rate of O(logp) (where p is the number of processors) is said to be more scalable than something whose growth rate is O(p). But in practice p does not grow without limits. We therefore suggest that discussions of scalability should take time into account. System sizes grow with time, so larger systems need to be supported - but only after some time. And in particular, there is no real need to support arbitrarily large systems right now. Surprisingly, when time is thus put into the picture, we find that centralized control is actually quite scalable. The reason is that the capabilities of a centralized control node grow at a fast pace due to Moore´s law. This seems to be more than enough in order to manage current growth patterns displayed by parallel systems.
Keywords :
computational complexity; multiprocessing programs; multiprocessing systems; parallel processing; MPP; Moore law; centralized control; cluster scalability; computational complexity; multiprocessing programs; multiprocessing systems; parallel system; Centralized control; Clocks; Computer science; Control systems; Costs; Equations; Moore´s Law; Productivity; Scalability; Size measurement;
Conference_Titel :
Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International
Print_ISBN :
0-7695-2312-9
DOI :
10.1109/IPDPS.2005.307