• The Journal of Society for e-Business Studies
• /
• v.17 no.1
• /
• pp.53-74
• /
• 2012

This study developed a method for selection of available human resources for incomingjob allocation that considers factors affecting resource performance in the business process management (BPM) environment. For many years, resource selection has been treated as a very important issue in scheduling due to its direct influence on the speed and quality of task accomplishment. Even though traditional resource selection can work well in many situations, it might not be the best choice when dealing with human resources. Humanresource performance is easily affected by several factors such as workload, queue, working hours, inter-arrival time, and others. The resource-selection rule developed in the present study considers factors that affect human resource performance. We used a Bayesian Network (BN) to incorporate those factors into a single model, which we have called the Bayesian Selection Rule (BSR). Our simulation results show that the BSR can reduce waiting time, completion time and cycle time.

• Journal of the Korea Institute of Building Construction
• /
• v.14 no.5
• /
• pp.467-476
• /
• 2014

According to the expanding of construction machinery works, the number of civil complaints demanding compensations are increasing continuously from surrounding residents due to the noise from construction fields. However, the noise is usually managed restrictedly during the construction phase rather than prevented in advance. So, the efforts to solve the noise problem are occurring only after complaints have been made. Also, excessive cost and time consuming in order to solve the complaints negatively affects to construction companies. Therefore, the purpose of this study is to develop an optimized scheduling process model for controlling the noise in construction field by considering the planned time, cost, and the number of equipment before construction. In addition, this process model is expected to provide a useful information about the cost comparison between the original planned cost plus compensation and the optimized cost considering noise limitation so that the site managers can manage their projects effectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.76-78
• /
• 2001

실시간 시스템의 중요성이 높아짐에 따라 실시간 시스템의 성능 향상을 위한 다양만 방법들이 연구기어 왔다. 된 논문에서는 실시간 시스템에서 가상 페이지 시스템을 통해 메모리를 관리할 때 기존의 LRU 방식에 의한 메모리 교체 방법 대신 실시간 프로세스 스케줄링과 유사한 실시간 메모리 교체 기법을 제안하였다. 실시간 메모리 교제 기법은 가장 오래 전에 사용된 페이지를 먼저 교체하는 LRU 방식의 메모리 교체 기법 대신 실시간 프로세스의 마감 시간 또는 주기를 기반으로 페이지를 교체함으로써 시간제약성을 준수할 가능성을 높인다. 시뮬레이션을 통해 성능을 평가만 결과 실시간 메모리 교체 기법을 통해 실시간 프로세스의 마감 시간 성공 가능성이 높아짐을 확인하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.337-344
• /
• 2000

In this paper, we define a Process Algebra ACSMR(Algebra of Communicating Shared Multiple Resources) for system specification and verification using multiple resources. ACSMR extends a concept of multiple resources in ACSR that is a branch of formal methods based on process algebra. We'll show that two specification and verification examples. One is the specification of system behavior in multiprocessor using EDF(Earliest-Deadline-First) which is a scheduling algorithm of a real-time system. The other is the specification of describing timing analysis and resources restriction in a super scalar processor using multiple ports registers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.295-303
• /
• 2005

Recently, according to the rapid increase of Web users, various kinds of Web applications have been being developed. Hence, Web QoS(Quality of Service) becomes a critical issue in the Web services, such as e-commerce, Web hosting, etc. Nevertheless, most Web servers currently process various requests from Web users on a FIFO basis, which can not provide differentiated QoS. This paper presents a load balancing method to provide differentiated Web QoS in clustering web server. The first is the kernel-level approach, which is adding a real-time scheduling process to the operating system kernel to maintain the priority of user requests determined by the scheduling process of Web server. The second is the load-balancing approach, which uses IP-level masquerading and tunneling technology to improve reliability and response speed upon user requests. The third is the dynamic load-balancing approach, which uses the parameters related to the MIB-II of SNMP and the parameters related to load of the system such as memory and CPU.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.283-290
• /
• 2016

As the development of recent science and technology, high-performance computing resources is needed to solve complex problems. To reach these requirements, it has been actively studied about grid computing that consist of a huge system which bind a heterogeneous high performance computing resources into on which are geographically dispersed. However, The current research situation which are the process to obtain the best results in the limited resources and the scheduling policy to accurately predict the total execution time of the real-time task are very poor. In this paper, in order to overcome these problems, we suggested a grid computing-based risk management system which derived from the system structure and the process for improving the efficiency of the system, grid computing-based working methodology, risk policy module which can manage efficiently the problem of the work of resources(Agent), scheduling technique and allocation method which can re-allocate the resource allocation and the resources in problem, and monitoring which can manage resources(Agent).

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.44-46
• /
• 2000

본 논문은 Tertiary 저장장치를 이용한 대용량 비디오 서버의 설계와 구현에 대해서 기술한다. 서버는 서비스와 프로세스 관리 서브시스템, 자원 관리 서브시스템, 입출력 관리 서브시스템의 세 부분으로 구성된다. 입출력 대역폭이 낮은 Tertiary 저장장치의 효율적인 사용을 위해 디스크 캐쉬 풀 모델을 사용하고, 적절한 스케줄링 정책과 캐슁 알고리즘을 이용하여 가능한 많은 사용자를 수용한다. 서버는 Windows 2000에서 시스템 서비스로 구현되었으며 디스크 캐쉬의 효과적인 사용으로 Tertiary 저장장치의 낮은 대역폭을 최대한 활용하여 접속된 사용자에게 안정된 비디오 스트리밍 서비스를 제공한다.

• The Magazine of the IEIE
• /
• v.29 no.9
• /
• pp.87-100
• /
• 2002

실시간 시스템은 응용 프로그램의 수행에 있어서 프로세서의 동작이나 자료의 흐름에 대해서 시한성이 매우 엄격한 시스템이다. 따라서 실시간 운영체제는 이러한 응용 프로그램의 요구에 대처하여 시스템의 자원을 적절히 배분하여 그 시한성을 엄격히 만족시켜 줄 수 있어야 한다. 자원의 배분에 있어서 특히 중요한 고려사항은 태스크들의 스케쥴링과 관계가 있다. 본 논문에서는 상용 실시간 운영체제에서 구현되어 서비스하고 있는 널리 알려진 실시간 스케쥴링 기법에 대해서 연구하고, 또한 최근 실시간 스케쥴링에서 고려되고 있는 사항들에 대한 현황을 파악한다.

• KNOM Review
• /
• v.22 no.1
• /
• pp.60-67
• /
• 2019

Graphical Processing Units(GPUs) achieve high performance undertaking from relatively uniformed computation in parallel. The technology related to General Purpose GPU(GPGPU) has been enhanced, which provides concurrent kernel execution of multi and diverse applications at the same time, but it is still limited to support resource sharing or planning. NVIDIA recently introduces Multi-Process Service(MPS), which allows kernels from different applications can be execute concurrently. However, the strength of MPS comes along with the characteristics of applications and the order of their execution. This paper shows the performance analysis of diverse scientific applications in real world. Based on the analysis, we prove that it is important to the identify characteristics of co-run applications, and to schedule multiple applications via profiling to maximize MPS functionality.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.405-415
• /
• 1999

웹의 성장은 점차 복잡한 응용에 대한 요구를 가중시켰으며, 데이타베이스와 웹과의 효율적인 연동 역시 중요한 문제가 되었다. 본 논문에서는 이와 같은 환경을 효율적으로 지원하기 위한 웹 응용 서버 WATS를 설계하고 구현하였다. WATS에서 응용 프로그램은 컴포넌트 단위로 작성된 후 동적으로 링크되고 요청을 처리할 응용 서버가 대기 상태로 존재하는 확장 API 응용 서버 방식으로 구현되었으며, 이러한 웹 서버와 응용 서버의 분리 구조는 대량의 요청을 처리하기에 적합하다. 또한 컴포넌트를 특성에 따라 분류한 후 각 특성에 적합한 특성 기반 스케줄링 알고리즘을 적용하여 프로세스 부하 균형을 이루었으며, 이 기법이 일반적인 라운드 로빈 스케줄링 알고리즘보다 좋은 성능을 나타냄을 성능 측정을 통해서 보인다.Abstract The increasing popularity of the World-Wide-Web (WWW) has resulted in demand for more complex applications, and web gateways to database became core component in such applications. In this paper, we have designed and implemented WATS in order to support these environments. In WATS, application components are dynamically linked with application server processes. And it is implemented as extensible API application server architecture and is able to process a large amount of requests through separating web server from application server. Also we classify the components into various categories according to its own properties and devise process load balancing algorithm by using property-based scheduling. We show WATS using this algorithm performs better than those using general round-robin algorithm.