Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing
| Autor: | A.L. Rosenberg, M. Yurkewych |
|---|---|
| Rok vydání: | 2005 |
| Předmět: |
Schedule
business.industry Computer science Distributed computing Computation Parallel computing computer.software_genre Theoretical Computer Science Scheduling (computing) Computational Theory and Mathematics Grid computing Hardware and Architecture Mesh generation The Internet business computer Software |
| Zdroj: | IEEE Transactions on Computers. 54:428-438 |
| ISSN: | 0018-9340 |
| Popis: | A "pebble game" is developed to model the process of scheduling computation-dags for Internet-based computing (IC, for short). Strategies are derived for scheduling three common, significant families of such dags for IC: reduction-meshes, which represent (the intertask dependencies of) computations that can be performed by "up-sweeps" of meshes; reduction-trees, which represent "accumulative" computations that can be performed by "up-sweeps" of trees; and FFT (fast fourier transform) dags, which represent a large variety of convolutional computations. Two criteria are used to assess the quality of a schedule: its memory requirements and its rate of producing tasks that are eligible for allocation to remote clients. These criteria are important because of, respectively, the typically enormous sizes of IC computations and the typical temporal unpredictability of remote clients in IC. In particular, a high production rate of eligible tasks decreases a computation's vulnerability to the gridlock that can occur when a computation stalls pending the return of intermediate results by remote clients. Under idealized assumptions, the schedules derived are optimal in the rate of producing eligible tasks and are either exactly or approximately optimal in memory requirements. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|