Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Job scheduling of Savant for Grid computing on RFID EPC network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yi-Lun Pan ; Graduate Inst. of Inf. Manage., Nat. Chung Cheng Univ., Chia-Yi, Taiwan ; Yueh-Ching Lee ; Fan Wu

In the Grid computing environment, there are many important issues, including information service, information security, resource management, routing, fault tolerance, and so on. Job scheduling is a major problem since it is a fundamental and crucial step in achieving high performance. The job scheduling problem has been treated as a combinatorial-optimization problem. Scheduling in a Grid environment can be seen as an extension to the scheduling problem on local parallel systems. In the research, we focus on applying the technologies of RFID and Grid computing to the architecture of the EPC network. There are many applications needing computing power of the Grid to deal with the huge quantity of incoming EPC data. According to the architecture of the EPC network and the environment of Grid computing, they have several similar characteristics. Therefore, we propose a new algorithm that modifies the traditional GA and integrates SA. Since the processes of GA and SA keep no memory, some problems may be visited again. In order to overcome this drawback, we design a learning scheme to remember visited statues to reduce the probability of the re-visiting improvement the performance in the search space. It can help to find the optimal or near-optimal scheduling efficiently and avoid the resource deadlock. Furthermore, our proposed algorithm, HGASA - with learning scheme, also considers about several properties of grid computing environment and EPC network, such as heterogeneity, dynamic adaptation and the independent relationship of jobs.

Published in:

Services Computing, 2005 IEEE International Conference on  (Volume:2 )

Date of Conference:

11-15 July 2005