Results 241 to 250 of about 389,722 (290)
Some of the next articles are maybe not open access.

Related searches:

Dynamics in scheduled networks

Chaos: An Interdisciplinary Journal of Nonlinear Science, 2009
When studying real or virtual systems through complex networks theories, usually time restrictions are neglected, and a static structure is defined to characterize which node is connected to which other. However, this approach is oversimplified, as real networks are indeed dynamically modified by external mechanisms. In order to bridge the gap, in this
Massimiliano, Zanin   +2 more
openaire   +2 more sources

Dynamic scheduling with incomplete information

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures - SPAA '98, 1998
We consider the following scheduling problem: Our goal is to execute a given amount of arbitrarily decomposable work on a distributed machine as quickly as possible. The work is maintained by a central scheduler that can assign chunks of work of an arbitrary size to idle processors. The difficulty is that the processing time required for a chunk is not
openaire   +2 more sources

Home - About - Disclaimer - Privacy