A method to solve the scalability problem in managing massively parallel processing on the Internet

A set of computers connected by the Internet can be seen as a MIMD virtual parallel computer with distributed memory. We call such a computer a Massively Parallel Virtual Computer (MPVC). The implementation of an MPVC will be feasible in the next few years, as new technologies brine to Internet communication speeds undreamed of nowadays. Problems such as Monte Carlo simulations and image processing and generation are good candidates to take advantage of MPVCs, since they can use practically all the computing power they can get. Massively Parallel Processing on the Internet introduces the problem of scalability, that is, how to administrate efficiently a large number of computers and an even larger number of tasks running in them, Previous approaches either do not scale well or let the program mer solve the problem by himself. This paper explains the Dynamic Virtual Hypercubes, a structure created to logically organize an MPVC. Dynamic Virtual Hypercubes provide a scalable and efficient way to handle a large number of computers and tasks, since they can adapt to changes in workload and number of available machines