Matches in UGent Biblio for { <https://biblio.ugent.be/publication/404617#aggregation> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- aggregation classification "P1".
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation date "2004".
- aggregation hasFormat 404617.bibtex.
- aggregation hasFormat 404617.csv.
- aggregation hasFormat 404617.dc.
- aggregation hasFormat 404617.didl.
- aggregation hasFormat 404617.doc.
- aggregation hasFormat 404617.json.
- aggregation hasFormat 404617.mets.
- aggregation hasFormat 404617.mods.
- aggregation hasFormat 404617.rdf.
- aggregation hasFormat 404617.ris.
- aggregation hasFormat 404617.txt.
- aggregation hasFormat 404617.xls.
- aggregation hasFormat 404617.yaml.
- aggregation isPartOf urn:isbn:1-932415-26-2.
- aggregation language "eng".
- aggregation publisher "CSREA Press".
- aggregation subject "Technology and Engineering".
- aggregation title "On the use of NSGrid for accurate grid schedule evaluation".
- aggregation abstract "Computational Grids consist of a multitude of geographically distributed resources. The co-allocation of several of those resources allows for the execution of highly computing-intensive and data-intensive jobs. In order to obtain quality schedules (in terms of job response time and resource utilization), different factors such as resource load (computational resource load and band-width usage) and data location need to be taken into account. In addition, because of the size of realistic Grids, relevant parameters w.r.t. schedule quality can often only be obtained through simulations. In this paper, we detail how a discrete-event simulator was extended to support the simulation of scheduling both cpu- and data-intensive jobs on a Grid using network-aware scheduling algorithms. These jobs can either pre-stage data, or access data remotely while executing. We examine the case in which resource-to-resource data connections with guaranteed bandwidth can be set up, both when capacitated Virtual Private Networks (for certain job classes) are defined upfront and when connection requests for all jobs are dealt with in a pure First Come First Serve way. Our results show that in order to generate quality grid schedules, it is necessary to take into account network status information in the scheduling algorithms in order to improve the average job response time. Furthermore, we show how making upfront bandwidth reservations induces fair sharing of network resources between different job classes and thus improves the weighted average response time.".
- aggregation authorList BK76833.
- aggregation endPage "206".
- aggregation startPage "200".
- aggregation isDescribedBy 404617.
- aggregation similarTo LU-404617.