Denver / Santos / San Francisco / A GA / Montreal / Baltimore / Cancun / Bangalore / Tokyo / Milano / Atlanta / Phoenix / Cambridge / Toronto / Melbourne / London / Lyon / San Diego / Edinburgh / /
Company
IEEE Computer / Distributed Systems / ACM Press / IEEE CS Press / Scheduling Distributed Data-Oriented Applications / Grid networks / Heterogeneous Computing Systems / Distributed Systems Laboratory / Mapping Heuristic For S a / P. / /
Country
Italy / Mexico / France / Japan / United States / Canada / Australia / United Kingdom / Scotland / India / / /
Facility
Imperial College / Software Engineering The University of Melbourne / University of Melbourne / Laboratory Department / /
IndustryTerm
Web caching / search function / generic scheduling algorithm / exhaustive search approach / public Internet / large search spaces / private local area network / storage device / high-energy physics / wide-area systems / close-tofiles processor / transport protocols / genetic algorithm / job execution site / data-intensive applications / power law model / simplified data-intensive computing environment consisting / performance computing platform / low latency transport protocols / data-intensive computing environment / approximate tree search algorithm / search space / /
Organization
University of Melbourne / U.S. Securities and Exchange Commission / Imperial College / Laboratory Department of Computer Science / Brute Force / European Union / Compute-First Greedy SCP Brute Force / /
Person
L. Breslau / Anthony Sulistio / Tianchi Ma / Morgan Kaufmann / Set Covering / Job Model / S. Shenker / Job Size / G. Phillips / /
Position
General / Resource Scheduler / Grid Service Broker / Storage Resource Broker / resource broker / scheduler / Cao / /
Product
GridSim / Torino / /
ProgrammingLanguage
J / /
ProvinceOrState
Hawaii / Georgia / /
PublishedMedium
Lecture Notes in Computer Science / /
Technology
LAN / low latency transport protocols / genetic algorithm / operating system / transport protocols / approximate tree search algorithm / close-tofiles processor / Close-to-Files algorithm / one processor / http / caching / simulation / Parallel Processing / generic scheduling algorithm / Network Protocols / /
A Set Coverage-based Mapping Heuristic for Scheduling Distributed Data-Intensive Applications on Global Grids Srikumar Venugopal and Rajkumar Buyya Grid Computing and Distributed Systems (GRIDS) Laboratory Department of