Academic
Publications
Dynamic resource selection heuristics for a non-reserved bidding-based Grid environment

Dynamic resource selection heuristics for a non-reserved bidding-based Grid environment,10.1016/j.future.2009.08.003,Future Generation Computer System

Dynamic resource selection heuristics for a non-reserved bidding-based Grid environment   (Citations: 4)
BibTex | RIS | RefWorks Download
A Grid system is comprised of large sets of heterogeneous and geographically distributed resources that are aggregated as a virtual computing platform for executing large-scale scientific applications. As the number of resources in Grids increases rapidly, selecting appropriate resources for jobs has become a crucial issue. To avoid single point of failure and server overload problems, bidding provides an alternative means of resource selection in distributed systems. However, under the bidding model, the key challenge of resource selection is that there is no global information system to facilitate optimum decision-making; hence requesters can only obtain partial information revealed by resource providers. To address this problem, we propose a set of resource selection heuristics to minimize the turnaround time in a non-reserved bidding-based Grid environment, while considering the level of information about competing jobs revealed by providers. We also present the results of experiments conducted to evaluate the performance of the proposed heuristics.
Journal: Future Generation Computer Systems - FGCS , vol. 26, no. 2, pp. 183-197, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...[2]A bidding process will be activated when resource requester broadcast a set of call-for-proposal (CFP) requests containing job requirements to resource providers...
    • ...Therefore a set of heuristics [2] based on the notion of probability are proposed to allocate jobs...

    Sonu Mariam Pauloseet al. Trust oriented resource allocation using bidding

    • ...Existing research primarily focuses on resource selection by readonly jobs [6], [7], [8]...
    • ...In [8], the proposed resource selection mechanism is based on two main algorithms, namely Minimum Execution Time (MET) and Minimum Completion Time (MCT) heuristics...
    • ...Two of them, namely Minimum Execution Time (MET) and Minimum Completion Time (MCT) algorithms are most recently used in [8]...

    Wan Nor Shuhadah Wan Niket al. Efficient Resource Selection Algorithm for Enterprise Grid Systems

Sort by: