• IEIE Transactions on Smart Processing and Computing
• /
• 제2권6호
• /
• pp.367-372
• /
• 2013

Cloud computing technology has been developing at an increasing expansion rate. Today most of firms are using this technology, making improving the quality of service one of the most important issues. To achieve this, the system must operate efficiently with less idle time and without deteriorating the customer satisfaction. This paper focuses on enhancing the efficiency of a conventional Genetic Algorithm (GA) for task scheduling in cloud computing using Fuzzy Logic (FL). This study collected a group of task schedules and assessed the quality of each task schedule with the user expectation. The work iterates the best scheduling order genetic operations to make the optimal task schedule. General GA takes considerable time to find the correct scheduling order when all the fitness function parameters are the same. GA is an intuitive approach for solving problems because it covers all possible aspects of the problem. When this approach is combined with fuzzy logic (FL), it behaves like a human brain as a problem solver from an existing database (Memory). The present scheme compares GA with and without FL. Using FL, the proposed system at a 100, 400 and 1000 sample size*5 gave 70%, 57% and 47% better improvement in the task time compared to GA.

• Journal of Communications and Networks
• /
• 제13권6호
• /
• pp.655-663
• /
• 2011

Diffuse optical wireless (DOW) systems have the advantage that they do not require point-to-point siting so one transmitter can communicate with several receivers. In this paper, we investigate multiple access scheduling methods for downlink orthogonal frequency division multiplexing (OFDM) in diffuse optical wireless networks. Unlike the radio frequency (RF) channel, the DOW channel has low-pass filter characteristics and so requires different scheduling methods than those developed for the RF channel. Multi-user diversity orthogonal frequency division multiple access (OFDMA) systems nominate a cluster of subcarriers with the largest signal-to-noise-ratio for transmission. However, in a DOW channel, most users would choose the lowest frequency clusters of subcarriers. To remedy this problem, we make two proposals. The first is to use a variable cluster size across the subcarriers; the lower frequency clusters will have fewer subcarriers while the higher frequency clusters will have more subcarriers. This will equalize the capacity of the clusters. The second proposal is to randomize a user's cluster selection from a group of clusters satisfying a minimum threshold. Through simulation it is shown that combining these strategies can increase the throughput while ensuring a fair distribution of the available spectrum.

• 대한안전경영과학회지
• /
• 제5권1호
• /
• pp.83-92
• /
• 2003

Scheduling plays an important role in shop floor planning. A scheduling shows the planned time when processing of a specific job will start on each machine that the job requires. It also indicates when the job will be completed on every process. Thus, it is a timetable for both jobs and machines. There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty. Based on other objectives, many criteria may serve as s basis for developing job schedules. The process also comprises all strategic planning, capital investments, management decisions, and tasks necessary to create a new product. manufacturing processes must be created so that the product can be produced in the product facility. Purchasing new equipment and training workers may be required if new technology is to be used. Tools, fixtures, and the sequence of steps in the manufacturing processes must all be developed to allow rapid, high-quality, cost effective production. Also, it may be needed to be rearrange the production facility to adapt to the new manufacturing processes. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.

• 산업경영시스템학회지
• /
• 제34권3호
• /
• pp.123-133
• /
• 2011

The advanced planning and scheduling(APS) is an well known enterprise information system that provides optimal production schedules and supports to complete production on time by solving the complex scheduling problems including capacity and due dates. In this paper, we focused on the improvement of the APS that is already established on a real company. The existing APS had several drawbacks, thus utilization and satisfaction were very low. We performed the focused group interviews and the process analysis and could find that the end users and developers have various objectives and the frequently used functions are different. We applied the analytical hierarchy process(AHP) to converge opinions of them on quantitative data. The results show that it is necessary to enhance visibility, to improve user interfaces and response speed, and to reconcile the real business process and the APS's process.

• Industrial Engineering and Management Systems
• /
• 제12권2호
• /
• pp.151-160
• /
• 2013

In the past decades, several algorithms based on evolutionary approaches have been proposed for solving job shop scheduling problems (JSP), which is well-known as one of the most difficult combinatorial optimization problems. Most of them have concentrated on finding optimal solutions of a single objective, i.e., makespan, or total weighted tardiness. However, real-world scheduling problems generally involve multiple objectives which must be considered simultaneously. This paper proposes an efficient particle swarm optimization based approach to find a Pareto front for multi-objective JSP. The objective is to simultaneously minimize makespan and total tardiness of jobs. The proposed algorithm employs an Elite group to store the updated non-dominated solutions found by the whole swarm and utilizes those solutions as the guidance for particle movement. A single swarm with a mixture of four groups of particles with different movement strategies is adopted to search for Pareto solutions. The performance of the proposed method is evaluated on a set of benchmark problems and compared with the results from the existing algorithms. The experimental results demonstrate that the proposed algorithm is capable of providing a set of diverse and high-quality non-dominated solutions.

• 전자공학회논문지
• /
• 제54권5호
• /
• pp.48-61
• /
• 2017

클라우드 컴퓨팅의 IaaS 서비스는 유지비용 없이 원하는 만큼의 고성능 가상 머신을 사용할 수 있다는 장점 덕분에 대용량 병렬 프로그램을 실행하기 위한 고성능 컴퓨팅 환경으로 주목받고 있다. 이러한 고성능 컴퓨팅 환경에서 병렬 프로그램의 실행에 소요되는 시간은 태스크 스케줄링 알고리즘에 좌우된다. 클라우드 컴퓨팅 환경을 기반으로 하는 태스크 스케줄링 알고리즘에 관한 연구는 사용자 부담 비용을 최소화하는 알고리즘이 주류를 이루었으며, 병렬 프로그램의 실행을 최대한 빨리 끝내기 위한 알고리즘에 관한 연구는 거의 이루어지지 않았다. 본 논문에서는 사용자 부담 비용 등의 제약 없이 병렬 프로그램을 최대한 빨리 끝내기 위한 알고리즘인 HAGD 알고리즘과, HAGD 알고리즘이 사용하는 새로운 성능 향상 기법인 묶음 태스크 복제 기법을 제안한다. 묶음 태스크 복제 기법은 기존 태스크 복제 기법을 단순화하였으며, HAGD 알고리즘은 고성능 컴퓨팅 환경과 병렬 프로그램의 특성에 맞추어 태스크 삽입 기법 혹은 묶음 태스크 복제 기법을 사용한다. 성능 평가 결과, 제안하는 알고리즘이 환경 특성과 관계없이 우수한 표준화한 전체 실행 시간을 제공하는 것을 확인하였다.

• 한국멀티미디어학회논문지
• /
• 제13권9호
• /
• pp.1285-1298
• /
• 2010

비선점형 태스크 스케줄링 정책을 사용하는 TinyOS는 선입선출 (FIFO: First-In First-Out) 방식의 태스크 스케줄링만 제공하기 때문에 최상위 우선순위를 가친 사용자 태스크가 즉시 실행이 필요한 태스크임에도 불구하고 우선순위가 낮은 태스크가 획득한 CPU 사용권한을 선점하지 못한다. 따라서 실시간 서비스를 요구하는 사용자 태스크 (User Task) 의 마감시한 (Deadline)을 보장할 수 없다. 또한, 비선점 환경의 TinyOS에서 사용자 태스크가 요청한 실시간 서비스를 완료하기 위해서는 사용자 태스크의 마감시한을 보장함과 동시에 사용자 태스크에서 호출 및 실행되는 TinyOS 플랫폼 태스크들의 마감시한도 보장해야 한다. 이에 본 논문에서는 비선점형 태스크 스케줄링 정책을 사용하는 기존 TinyOS 환경에서 실시간성을 제공하는 태스크 그룹 기반의 스케줄링 기법을 제안하였다. 제안한 기법은 요청한 사용자 태스크의 마감시한을 보장하기 위하여 사용자 태스크와 함께 사용자 태스크가 완료되기 위하여 호출 및 실행이 필요한 다수의 TinyOS 플랫폼 태스크를 태스크 그룹으로 형성한 후, 해당 태스크 그룹을 하나의 가상적인 큰 태스크 단위로 스케줄링한다. 제안한 기법의 동작을 시험한 결과, 제안한 기법은 비선점형 태스크 스케줄링 정책을 사용하는 TinyOS 환경에서 사용자 태스크의 마감시한을 보장함과 동시에 사용자 태스크의 평균 응답시간을 줄이고 기존 TinyOS 플랫폼간의 호환성을 제공할 수 있었다.

• 대한안전경영과학회지
• /
• 제2권2호
• /
• pp.139-153
• /
• 2000

To develope a domestic machinery industry, international competition through reducing cost by increasing productivity is as important as evolving technology and increasing quality. In this study, we have studied in application of GT technology. GT is a skill that acquires high productivity using part's resemblance for multi part and small size production like mass production. We have classified group, such as design, layout and the others, to be applied systematically. The design group includes retrieval for drawings and study for GT design. The layout group includes GT layout, analysis of production process and study for composition method. And others include scheduling, standardization and standard process.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권9호
• /
• pp.4103-4121
• /
• 2018

Quality of Service (QoS) awareness is recognized as a key point for the success of Internet of Things (IOT).Realizing the full potential of the Internet of Things requires, a real-time task scheduling algorithm must be designed to meet the QoS need. In order to schedule tasks with diverse QoS requirements in cloud environment efficiently, we propose a task scheduling strategy based on dynamic priority and load balancing (DPLB) in this paper. The dynamic priority consisted of task value density and the urgency of the task execution, the priority is increased over time to insure that each task can be implemented in time. The scheduling decision variable is composed of time attractiveness considered earliest completion time (ECT) and load brightness considered load status information which by obtain from each virtual machine by topic-based publish/subscribe mechanism. Then sorting tasks by priority and first schedule the task with highest priority to the virtual machine in feasible VMs group which satisfy the QoS requirements of task with maximal. Finally, after this patch tasks are scheduled over, the task migration manager will start work to reduce the load balancing degree.The experimental results show that, compared with the Min-Min, Max-Min, WRR, GAs, and HBB-LB algorithm, the DPLB is more effective, it reduces the Makespan, balances the load of VMs, augments the success completed ratio of tasks before deadline and raises the profit of cloud service per second.

• 한국통신학회논문지
• /
• 제31권4A호
• /
• pp.412-420
• /
• 2006

다양한 형태의 트래픽이 등장하면서 각 트래픽이 요구하는 서비스 품질을 모두 만족시키기 위한 패킷 스케줄링 연구에 대한 중요성이 커지고 있다. IEEE 802.11 위원회에서는 이러한 요구에 부응하기 위해 IEEE 802.11e 규격을 제정하여 모든 트래픽을 4가지로 분류한 뒤 각 트래픽 별로 차등화된 서비스를 제공하고 있다. 그리고 IEEE 802.11a/g규격에서는 물리계층에서의 전송속도를 무선 단말기 당 최대 54 Mbps까지 지원하고 있다. 하지만 무선 채널환경에서는 전체 대역폭이 제한되어 있기 때문에 주어진 대역폭 내에서 전송효율을 최대화시키는 문제는 항상 풀어야 하는 과제이다. 따라서 본 연구에서는 전송오류가 발생하는 무선통신 환경 하에서 동작하는 무선 LAN 단말기가 패킷 전송을 위해 CSMA-CA 기반으로 동작함에 있어서 CW(Contention Window) 값을 현재 무선채널 상태에 따라 달리 설정함으로써 서비스 처리량(Throughput)을 더욱 극대화할 수 있는 패킷 스케줄링 기법을 제안하였다. 제안된 알고리즘을 NS-2 네트워크 시뮬레이터를 이용하여 성능평가를 수행하였고, 수치 결과를 통해 제안한 알고리즘이 기존 IEEE 802.11e의 성능을 더욱 향상시킬 수 있음을 보였다.