Job scheduling of Savant for Grid computing on RFID EPC network

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.

[1]  Geoffrey C. Fox,et al.  An event service to support Grid computational environments , 2002, Concurr. Comput. Pract. Exp..

[2]  Po-Jen Chuang,et al.  An efficient optimization technique for task matching and scheduling in heterogeneous computing systems , 2002, Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings..

[3]  Phillip Krueger,et al.  ob Scheduling is More Important than Processor Allocation for Hypercube Computers , 1994, IEEE Trans. Parallel Distributed Syst..

[4]  R. V. van Nieuwpoort,et al.  The Grid 2: Blueprint for a New Computing Infrastructure , 2003 .

[5]  Dennis Gannon,et al.  A Summary of Grid Computing Environments , 2002 .

[6]  Ching-Chi Hsu,et al.  An annealing framework with learning memory , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[7]  Ming Wu,et al.  Grid Harvest Service: a system for long-term, application-level task scheduling , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[8]  Afonso Ferreira,et al.  Scheduling Multiprocessor Tasks with Genetic Algorithms , 1999, IEEE Trans. Parallel Distributed Syst..

[9]  Xue Hui-feng A Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems , 2005 .

[10]  Marin Golub,et al.  Scheduling Multiprocessor Tasks with Genetic Algorithms , 2019 .

[11]  Albert Y. Zomaya,et al.  Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues , 1999, IEEE Trans. Parallel Distributed Syst..

[12]  Yi-Hsuan Lee,et al.  A Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems , 2003 .