|
Volumn , Issue , 2007, Pages 210-217
|
Allocating resources to parallel query plans in data grids
|
Author keywords
[No Author keywords available]
|
Indexed keywords
BINARY TREE STRUCTURES;
COMMUNICATION COSTS;
COOPERATIVE COMPUTING;
DATA GRIDS;
DISTRIBUTED DATABASES;
INTERNATIONAL CONFERENCES;
PIPELINED PARALLELISM;
SCHEDULING PROBLEMS;
BINARY TREES;
BOOLEAN FUNCTIONS;
COMMUNICATION;
DATA STRUCTURES;
EARNINGS;
FILE ORGANIZATION;
GRID COMPUTING;
HEURISTIC ALGORITHMS;
HEURISTIC PROGRAMMING;
INDUSTRIAL ECONOMICS;
OPTIMIZATION;
PARALLEL ALGORITHMS;
RESOURCE ALLOCATION;
TREES (MATHEMATICS);
|
EID: 46449090557
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/GCC.2007.40 Document Type: Conference Paper |
Times cited : (9)
|
References (6)
|