NDLI: Best resource node selection using rough sets theory

Content Provider	IEEE Xplore Digital Library
Author	Zar Lwin Phyo Thida, A.
Copyright Year	2011
Description	Author affiliation: University of Computer Studies, Mandalay, Myanmar (Zar Lwin Phyo; Thida, A.)
Abstract	In Grid computing, the problem of selecting resources to specific jobs can be very complex, and may require co-allocation of different resources such as specific amount of CPU hours, system memory and network bandwidth for data transfer, etc. Because of the lack of centralized control and the dynamic nature of resource availability, any successful selection mechanism should be highly distributed and robust to the changes in the Grid environment. Moreover, it is desirable to have a selection mechanism that does not rely on the availability of coherent global information. This paper considers selection method in grid environment using rough set theory, which could select the best node in grid environment. The proposed method is designed to achieve the following goals: handling large number of incoming requests simultaneously; assigning each service efficiently to all the incoming requests; selecting the appropriate services for the incoming requests within a reasonable time. Random data is used to test the validity of proposed method in this paper. The result showed that this method can provide the suitable probability of the best node selection.
Starting Page	461
Ending Page	464
File Size	95518
Page Count	4
File Format	PDF
ISBN	9781612848396
e-ISBN	9781612848402
DOI	10.1109/ICCRD.2011.5764174
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-03-11
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Processor scheduling Rough sets Resource selection Grid computing Scheduling Approximation methods Resource management Rough set
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Estimating job execution time and handling missing job requirements using rough set in grid scheduling

Using rough set based multi-checkpointing for fault-tolerance scheduling in economic grids

Execution Time Prediction Using Rough Set Theory in Hybrid Cloud

Fault-Tolerance Scheduling by Using Rough Set Based Multi-checkpointing on Economic Grids

Grid resource scheduling based on fuzzy similarity measures

A new rough set based approach for optimized detection of available resources in Grid computing

Smart Replica Selection for Data Grids Using Rough Set Approximations (RSDG)

MMOD: A General Resource Scheduling Algorithm for Computational Grid

Dynamic Grid Resource Scheduling Model Using Learning Agent

Best resource node selection using rough sets theory

Similar Documents

Estimating job execution time and handling missing job requirements using rough set in grid scheduling

Using rough set based multi-checkpointing for fault-tolerance scheduling in economic grids

Execution Time Prediction Using Rough Set Theory in Hybrid Cloud

Fault-Tolerance Scheduling by Using Rough Set Based Multi-checkpointing on Economic Grids

Grid resource scheduling based on fuzzy similarity measures

A new rough set based approach for optimized detection of available resources in Grid computing

Smart Replica Selection for Data Grids Using Rough Set Approximations (RSDG)

MMOD: A General Resource Scheduling Algorithm for Computational Grid

Dynamic Grid Resource Scheduling Model Using Learning Agent

Best resource node selection using rough sets theory