Predictive resource management for meta-applications
Predictive resource management for meta-applications
This paper defines meta-applications as large, related collections of computational tasks, designed to achieve a specific overall result, running on a (possibly geographically) distributed, non-dedicated meta-computing platform. To carry out such applications in an industrial context, one requires resource management and job scheduling facilities (including capacity planning), to ensure that the application is feasible using the available resources, that each component job will be sent to an appropriate resource, and that everything will finish before the computing resources are needed for other purposes.
723-734
Floros, N
218f07c0-d7be-4e3e-8fb1-cf4382fe6919
Hey, A J G
f4e293d1-493d-4a14-9c89-9be45872531e
Meacham, K E
3d0e5c6b-8a98-4f2f-be51-aef0dad61fa5
Papay, J
21652b35-de29-439c-b343-cb3437ef2f9e
Surridge, M
3bd360fa-1962-4992-bb16-12fc4dd7d9a9
Hertzberger, L O
81fde430-1bb4-47de-ab11-2c70baff729e
Sloot, P M A
6c4df467-58d5-4e12-8b7e-2a917bb95a38
1999
Floros, N
218f07c0-d7be-4e3e-8fb1-cf4382fe6919
Hey, A J G
f4e293d1-493d-4a14-9c89-9be45872531e
Meacham, K E
3d0e5c6b-8a98-4f2f-be51-aef0dad61fa5
Papay, J
21652b35-de29-439c-b343-cb3437ef2f9e
Surridge, M
3bd360fa-1962-4992-bb16-12fc4dd7d9a9
Hertzberger, L O
81fde430-1bb4-47de-ab11-2c70baff729e
Sloot, P M A
6c4df467-58d5-4e12-8b7e-2a917bb95a38
Floros, N, Hey, A J G, Meacham, K E, Papay, J and Surridge, M
,
Hertzberger, L O and Sloot, P M A
(eds.)
(1999)
Predictive resource management for meta-applications.
Future Generation Computer Systems, 15, .
Abstract
This paper defines meta-applications as large, related collections of computational tasks, designed to achieve a specific overall result, running on a (possibly geographically) distributed, non-dedicated meta-computing platform. To carry out such applications in an industrial context, one requires resource management and job scheduling facilities (including capacity planning), to ensure that the application is feasible using the available resources, that each component job will be sent to an appropriate resource, and that everything will finish before the computing resources are needed for other purposes.
Text
1999-2574.pdf
- Other
More information
Published date: 1999
Organisations:
Electronics & Computer Science, IT Innovation
Identifiers
Local EPrints ID: 252574
URI: http://eprints.soton.ac.uk/id/eprint/252574
PURE UUID: 4bafd2d3-97bc-4418-ba25-c471c9cff92b
Catalogue record
Date deposited: 24 Mar 2003
Last modified: 14 Mar 2024 05:20
Export record
Contributors
Author:
N Floros
Author:
A J G Hey
Author:
K E Meacham
Author:
J Papay
Author:
M Surridge
Editor:
L O Hertzberger
Editor:
P M A Sloot
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics