List Scheduling Method for Service Oriented Grid Applications

Author(s):  
SungHo Chin ◽  
JongHyuk Lee ◽  
TaeMyoung Yoon ◽  
HeonChang Yu
Author(s):  
Gang Li ◽  
Jianwu Wang ◽  
Jing Wang ◽  
Yanbo Han ◽  
Zhuofeng Zhao ◽  
...  

Author(s):  
Hanxi Zhang ◽  
Michel Savoie ◽  
Scott Campbell ◽  
Sergi Figuerola ◽  
Gregorx von Bochmann ◽  
...  

Author(s):  
Geoffrey Fox ◽  
Shrideep Pallickara ◽  
Marlon Pierce ◽  
Harshawardhan Gadgil

Grid application frameworks have increasingly aligned themselves with the developments in Web services. Web services are currently the most popular infrastructure based on service-oriented architecture (SOA) paradigm. There are three core areas within the SOA framework: (i) a set of capabilities that are remotely accessible, (ii) communications using messages and (iii) metadata pertaining to the aforementioned capabilities. In this paper, we focus on issues related to the messaging substrate hosting these services; we base these discussions on the NaradaBrokering system. We outline strategies to leverage capabilities available within the substrate without the need to make any changes to the service implementations themselves. We also identify the set of services needed to build Grids of Grids. Finally, we discuss another technology, HPS earch , which facilitates the administration of the substrate and the deployment of applications via a scripting interface. These issues have direct relevance to scientific Grid applications, which need to go beyond remote procedure calls in client-server interactions to support integrated distributed applications that couple databases, high performance computing codes and visualization codes.


2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Huimin Niu ◽  
Minghui Zhang

The most important operating problem for intercity rail lines, which are characterized with the train operations at rapid speed and high frequency, is to design a service-oriented schedule with the minimum cost. This paper proposes a phase-regular scheduling method which divides a day equally into several time blocks and applies a regular train-departing interval and the same train length for each period under the period-dependent demand conditions. A nonlinear mixed zero-one programming model, which could accurately calculate the passenger waiting time and the in-train crowded cost, is developed in this study. A hybrid genetic algorithm associated with the layered crossover and mutation operation is carefully designed to solve the proposed model. Finally, the effectiveness of the proposed model and algorithm is illustrated through the application to Hefei-Wuhan intercity rail line in China.


Sign in / Sign up

Export Citation Format

Share Document