• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.370-379
• /
• 2006

Computational grid provides the environment which integrates v 따 ious computing resources. Grid environment is more complex and various than traditional computing environment, and consists of various resources where various software packages are installed in different platforms. For more efficient usage of computational grid, therefore, some kind of integration is required to manage grid resources more effectively. In this paper, a global scheduler is suggested, which integrates grid resources at meta level with applying various scheduling policies. The global scheduler consists of a mechanical part and three policies. The mechanical part mainly search user queues and resource queues to select appropriate job and computing resource. An algorithm for the mechanical part is defined and optimized. Three policies are user selecting policy, resource selecting policy, and executing policy. These can be defined newly and replaced with new one freely while operation of computational grid is temporarily holding. User selecting policy, for example, can be defined to select a certain user with higher priority than other users, resource selecting policy is for selecting the computing resource which is matched well with user's requirements, and executing policy is to overcome communication overheads on grid middleware. Finally, various algorithms for user selecting policy are defined only in terms of user fairness, and their performances are compared.

• International Journal of Contents
• /
• v.6 no.2
• /
• pp.10-13
• /
• 2010

For applications that are grid enabled, the grid can offer a resource balancing effect by scheduling grid jobs on machines with low utilization. When jobs communicate with each other, the internet, or with storage resources, an advanced scheduler could schedule them to minimize communications traffic or minimize the distance of the communications. We propose an intelligent load distribution algorithm to minimize communications traffic and distance of the communications using genetic algorithm. The experiments show the proposed load redistribution algorithm performs efficiently in the variance of load in grid environments.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.2
• /
• pp.1-8
• /
• 2010

In this paper, we propose a scheduling strategy for grid environment that reduces resource cost. This strategy considers resource cost and job failure rate to efficiently allocate local computing resources. The key idea of our strategy is that we use two-level scheduling using remote and local scheduler. The remote scheduler determines the expected total execution times of jobs using the current network and local system status maintained in its resource database and allocates jobs with minimum total execution time to local systems. The local scheduler recalculates the waiting time and execution time of allocated job and uses it to determine whether the job can be processed within the specified deadline. If it cannot finish in time, the job is migrated other local systems, through simulation, we show that it is more effective to reduce the resource cost than the previous Greedy strategy. We also show that the proposed strategy improves the performance compared to previous Greedy strategy.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.511-520
• /
• 2009

Grid technology enables high performance computation and mass data processing by connecting geographically distributed computing resources to high-speed network. To carry on grid tasks requiring guaranteed quality of service, we need to build converged infrastructure which controls and manages network resources as well as computing resources. In this paper, we defined grid network service interface and information model to support grid network path, resource creation and reservation. In addition to resource creation and reservation messages of the existing GLIF, grid network path and notification messages were defined in the grid network service interface. We also defined related statuses and messages for two-phase resource reservation mechanism. We designed and implemented network resource management system based on the grid network information model and service interface. We experimented in resource reservation, allocation and release of network resources in grid environment with GMPLS control and transport network.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.9
• /
• pp.2350-2353
• /
• 2009

For applications that are grid enabled, the grid can offer a resource balancing effect by scheduling grid jobs on machines with low utilization. When jobs communicate with each other, the internet, with storage resources, an advanced scheduler could schedule them to minimize communications traffic or minimize the distance of the communications. We propose an load redistribution algorithm to minimize communication traffic and distance of the communication using genetic algorithm. The experiments show the proposed load redistribution algorithm performs efficiently in the variance of load in grid environments.

• KIISE Transactions on Computing Practices
• /
• v.22 no.12
• /
• pp.663-674
• /
• 2016

Traditional supercomputing services suffer from limited accessibility and low utilization in that users(researchers) may perform computational executions only using terminal-based command line interfaces. To address this problem, in this paper, we provide the design and implementation details of National supercomputing service framework. The proposed framework supports all the fundamental primitive functions such as user management/authentication, heterogeneous computing resource management, HPC (High Performance Computing) job management, etc. so that it enables various 3rd-party applications to be newly built on top of the proposed framework. Our framework also provides Web-based RESTful OpenAPIs and the abstraction interfaces of job schedulers (as well as bundle scheduler plug-ins, for example, LoadLeveler, Open Grid Scheduler, TORQUE) in order to easily integrate the broad spectrum of heterogeneous computing clusters. To show and validate the effectiveness of the proposed framework, we describe the best practice scenario of high energy physics Lattice-QCD as an example application.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.227-230
• /
• 2014

LTE 3GPP standard defines several QCI (QoS Class Identifier) classes to provide differential QoS, depending on the requirements of different user applications.These QCI values have been characterized in terms of priority, packet loss and delay budget. In spite of the availability of this robust QoS framework in LTE, there is no such scheduling algorithm that has its working principle based on this framework. The responsibility of fulfilling the user requirements, while satisfying the service class requirements is left upon the cellular service provider and it is an open issue at present. To solve this problem, we have proposed a MAC scheduler, which defines the priority of different users based on their bearer specification and provides desired QoS in terms of the achieved throughput through the resource block allocation based on calculated user priority.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1450-1458
• /
• 2011

The HPcN (Hybrid & high Performance Convergence Network) in research networks means environment which can provide both computing resource such as supercomputer, cluster and network resource to application researchers in the field of medical, bio, aerospace and e-science. The most representative research network in Korea, KREONET has been developing following technologies through the HERO (Hybrid Networking project for research oriented infrastructure) from 200S. First, we have constructed and deployed a control plane technology which can provide a connection oriented network dynamically. Second, the integrated resource management system technology has been developing for reservation and allocation of both computing and network resources, whenever users want to utilize them. In this paper, a testbed network is presented, which is possible to reserve and allocate network resource using the integrated resource management system. We reserve network resource through GNSI (Grid Network Service Interface) messages between GRS (Global Resource Scheduler) and NRM (Network Resource Manager) and allocate network resource through GUNI (Grid User Network Interface) messages between the NRM (network resource manager) and routers, based on reservation information provided from a user on the web portal. It is confirmed that GUNI interface messages are delivered from the NRM to each router at the starting of reservation time and traffic is transmitted through LSP allocated by the NRM.