Resource Management for Data Intensive Tasks on Grids
Bibliographic record
Abstract
Distributed systems such as Grids, aim to enable the sharing, selection, and aggregation of a wide variety of resources that are geographically distributed and often owned by different organizations. These resources collaborate for performing complex tasks. Without efficient resource management, the benefits of a Grid system cannot be realized, especially for large-scale computational and data intensive tasks. The efficient management of distributed resources to perform a complex task is important. In a Grid, a resource management system is responsible for managing the available resources for a given task to be performed. This thesis proposes an effective resource management system called BiLeG, which can be used for performing resource intensive tasks in a Grid computing environment. This thesis focuses on the problem of allocating resources for a group of a particular type of resource intensive tasks termed Processable Bulk Data Transfer (PBDT) tasks. A PBDT task involves the transfer of a very large volume of data that has to be processed in some way before it can be used at a remote set of sink nodes. In BiLeG, the resource management system is bifurcated into separate upper and lower decision making levels and separate responsibilities are assigned to each decision making level. The upper decision making level of BiLeG, called the Task Resource Pool Selector (TRPS), is concerned with selection of a resource-pool for the given task. The lower decision making level, called Resource Allocator (RA) is responsible for allocating resources out of the resource-pool chosen by TRPS. At TRPS, a policy determines the way the resource-pool is chosen for each of the tasks. At RA, an algorithm which determines the allocation of the resources from its resource-pool for the task selected by TRPS is deployed. Note that the resource allocation problem considered in this research focuses on achieving a good balance between multiple performance metrics. Although existing research has addressed various issues in resource allocation, none of the existing works has dealt with resource allocation for PBDT tasks addressing multiple performance metrics that this research focuses on.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.004 | 0.002 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".