Performance models of multiprocessor systems
Performance models of multiprocessor systems
CNS '97 Proceedings of the sixth annual conference on Computational neuroscience : trends in research, 1998: trends in research, 1998
IEEE Transactions on Parallel and Distributed Systems
Condor-G: A Computation Management Agent for Multi-Institutional Grids
Cluster Computing
When the Herd Is Smart: Aggregate Behavior in the Selection of Job Request
IEEE Transactions on Parallel and Distributed Systems
Parallel Processing on Dynamic Resources with CARMI
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
The ANL/IBM SP Scheduling System
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Using Queue Time Predictions for Processor Allocation
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Core Algorithms of the Maui Scheduler
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Distributed data mining on the grid
Future Generation Computer Systems - Grid computing: Towards a new computing infrastructure
Experiences with predicting resource performance on-line in computational grid settings
ACM SIGMETRICS Performance Evaluation Review
The Globus Project: A Status Report
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
High Performance Parametric Modeling with Nimrod/G: Killer Application for the Global Grid?
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Scheduling in Bag-of-Task Grids: The PAUÁ Case
SBAC-PAD '04 Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing
Application of grid computing to parameter sweeps and optimizations in molecular modeling
Future Generation Computer Systems
Transparent Resource Allocation to Exploit Idle Cluster Nodes in Computational Grids
E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing
A comprehensive model of the supercomputer workload
WWC '01 Proceedings of the Workload Characterization, 2001. WWC-4. 2001 IEEE International Workshop
Performance prediction and its use in parallel and distributed computing systems
Future Generation Computer Systems - Systems performance analysis and evaluation
Exploiting replication and data reuse to efficiently schedule data-intensive applications on grids
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Are user runtime estimates inherently inaccurate?
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Workflow-based resource allocation to optimize overall performance of composite services
Future Generation Computer Systems
Heuristic for resources allocation on utility computing infrastructures
Proceedings of the 6th international workshop on Middleware for grid computing
Considerations on using transactions in workflow design
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Journal of Systems and Software
The impact of service demand variability on resource allocation strategies in a grid system
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A taxonomy of peer-to-peer desktop grid paradigms
Cluster Computing
Scheduling mapreduce jobs in HPC clusters
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Hi-index | 0.00 |
As the adoption of grid computing in organizations expands, the need for wise utilization of different types of resource also increases. A volatile resource, such as a desktop computer, is a common type of resource found in grids. However, using efficiently other types of resource, such as space-shared resources, represented by parallel supercomputers and clusters of workstations, is extremely important, since they can provide a great amount of computation power. Using space-shared resources in grids is not straightforward since they require jobs a priori to specify some parameters, such as allocation time and amount of processors. Current solutions (e.g. Grid Resource and Allocation Management (GRAM)) are based on the explicit definition of these parameters by the user. On the other hand, good progress has been made in supporting Bag-of-Tasks (BoT) applications on grids. This is a restricted model of parallelism on which tasks do not communicate among themselves, making recovering from failures a simple matter of reexecuting tasks. As such, there is no need to specify a maximum number of resources, or a period of time that resources must be executing the application, such as required by space-shared resources. Besides, this state of affairs makes leverage from space-shared resources hard for BoT applications running on grid. This paper presents an Explicit Allocation Strategy, in which an adaptor automatically fits grid requests to the resource in order to decrease the turn-around time of the application. We compare it with another strategy described in our previous work, called Transparent Allocation Strategy, in which idle nodes of the space-shared resource are donated to the grid. As we shall see, both strategies provide good results. Moreover, they are complementary in the sense that they fulfill different usage roles. The Transparent Allocation Strategy enables a resource owner to raise its utilization by offering cycles that would otherwise go wasted, while protecting the local workload from increased contention. The Explicit Allocation Strategy, conversely, allows a user to benefit from the accesses she has to space-shared resources in the grid, enabling her natively to submit tasks without having to craft (time, processors) requests.