• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.886-895
• /
• 2004

In this paper, we propose the dynamic allocation scheme of the CPU bandwidth to efficiently integrate and schedule these tasks in the same system, where multimedia tasks and hard real-time tasks can coexist simultaneously. Hard real-time tasks are guaranteed based on worst case execution times, whereas multimedia tasks modeled as soft real-time tasks are served based on mean parameters. This paper describes a server-based allocation scheme for assigning the CPU resource to two types of tasks. Especially for MPEG video streams, we show how to dynamically control the fraction of the CPU bandwidth allocated to each multimedia task. The primary purpose of the proposed method is to minimize the mean tardiness of multimedia tasks while satisfying the timing constraints of hard real-time tasks present in the system. We showed through simulations that the tardiness experienced by multimedia tasks under the proposed allocation scheme is much smaller than that experienced by using other scheme.

• Journal of the Ergonomics Society of Korea
• /
• v.26 no.2
• /
• pp.45-59
• /
• 2007

The operating tasks of overhead crane have caused undue stress to the operators from physical, mental, and environmental workload. Existing workload assessment models for musculoskeletal disorders such as OWAS, RULA, and QEC have limited applicability to the crane operating tasks because they focus mainly on physical factors and do not consider the relative importance of each factor. The present study was to develop a workload assessment model customized to overhead crane operation, following a systematic process: (1) analyzing task characteristics, (2) selecting workload factors, (3) developing assessment methods, (4) establishing action levels, and (5) computerizing the assessment model. Based on literature review, worksite survey, and focus group interview, 4 physical factors (awkward posture, static posture, repetitive motion, and excessive force), 6 mental factors (visual demand, auditory demand, task complexity and difficulty, time urgency, work schedule related stress, and safety related stress), and 4 environmental factors (noise, vibration, dust, and temperature) were selected and their rating scales and relative weights were determined. Then, based on the workload assessment results of 8 overhead cranes operated at different workplaces, the action levels of each factor category were established. Finally, the crane operation assessment model was computerized for effective analysis and report preparation. The present approach is applicable to develop a customized workload assessment model for an operating task under consideration.

• Journal of the Korean Society of Safety
• /
• v.23 no.5
• /
• pp.119-124
• /
• 2008

Many automobile assembly workers often do several cycles of tasks continuously, i.e., without breaks, to get a longer break. This is not recommended since the dose of fatigue increases exponetially with time and it takes much longer time to recover. In this study, a laboratory experiment was conducted to investigate the effect of work/rest schedules on workload of a repetitive upper-limb task. Eleven male subjects participated in the experiment, in which simulated screw driving tasks were carried out repetitively with 3 different work/rest schedules: standard breaks(1 cycle of work at a time, 60 20-s breaks), medium breaks(5 cycles of work at a time, 12 100-s breaks), and long breaks(10 cycles of work at a time, 6 200-s breaks). The result showed that medium- and long-breaks schedules significantly increased the level of perceived discomfort and %HRR as compared to the standard-break schedule. The subjects' preference was not statistically different among work/rest schedules, which might be caused from the absolutely low level of workload of the experimental tasks. From the results, it is recommended to have frequent and shorter breaks rather than infrequent and longer breaks to decrease the level of physical workload. A more expanded studies, however, should be carried out to provide more practical safety guidelines on the work practice of continuous working without breaks among automobile assembly workers.

• Proceedings of the KSR Conference
• /
• 2011.05a
• /
• pp.269-276
• /
• 2011

This paper considers the rail crane scheduling problem with minimizing the sum of the range of order completion time and make-span of rail crane simultaneously. The range of order completion time implies the difference between the maximum of completion time and minimum of start time. Make-span refers to the time when all the tasks are completed. At a rail terminal, logistics companies wish to concentrate on their task of loading and unloading container on/from rail freight train at a time in order to increase the efficiency of their equipment such as reach stacker. In other words, they want to reduce the range of their order completion time. As a part of efforts to meet the needs, the crane schedule is rearranged based on worker's experience. We formulate the problem as a mixed integer program. To validate the effectiveness of the model, computational experiments were conducted using a set of data randomly generated.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.170-172
• /
• 2012

실시간 시스템(real-time system)은 논리적 연산을 일정한 시간적 제약 하에서 수행하는 시스템이다. 시간적 제약을 충족하도록 주기적 태스크(periodic task)를 스케줄(schedule)할 때 일반적으로 태스크 오프셋(initial offset)이 0 이거나 고정된 것으로 가정한다. 그러나 오프셋에 약간의 유연성을 허용함으로써 태스크들의 평균 응답 시간을 줄일 수도 있다. 이 논문에서는 주기적 태스크의 오프셋을 주어진 허용 범위 안에서 선택하여 평균 응답 시간(response time)을 최적화할 수 있음을 보이고, 임의의 태스크 집합에 대하여 최적 오프셋이 존재하는 좁은 범위를 제시한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.949-966
• /
• 2013

Recently, Wireless Body Area Network (WBAN) has promise to revolutionize human daily life. The need for multiple sensors and constant monitoring lead these systems to be energy hungry and expensive with short operating lifetimes. In this paper, we offer a review of existing work of WBAN and focus on energy-aware management in it. We emphasize that nodes computation, wireless communication, topology deployment and energy scavenging are main domains for making a long-lived WBAN. We study the popular power management technique Dynamic Voltage and Frequency Scaling (DVFS) and identify the impact of slack time in Dynamic Power Management (DPM), and finally propose an enhanced dynamic power management method to schedule scaled jobs at slack time with the goal of saving energy and keeping system reliability. Theoretical and experimental evaluations exhibit the effectiveness and efficiency of the proposed method.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.357-360
• /
• 2001

Design Engineering Group, LG Production engineering Research Center has been developing The Integrated Design Environment enabling engineering design task with ease, speedy and accurate for several years targeting the design departments in LG Electronics. $ezDesign^{(R)}$ System is consisted by Engineering Database Management, Engineering Knowledge Management, 3D Design Application, Design Evaluation Method and Project Management. Engineering Database Management manage the design information effectively. Engineering Knowledge Management takes control of design knowledge from design engineering activity systematically. It is possible for the engineering designer to utilized 3D CAD easily by 3D Design Application. Design Evaluation Method can evaluate several design alternatives synthetically. In Project management System, Designer can simulate the project schedule and cost. In this report, We will introduce how design process can be innovated by way of $ezDesign^{(R)}$ System.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2060-2071
• /
• 2000

Scheduling parallel tasks, represented as a Directed Acyclic Graph (DAG) or task graph, on a multiprocessor system has been an important research area in the past decades. List scheduling algorithms assign priorities to a node or an edge in an input DAG, and then generate a schedule according to the assigned priorities. This appear proposes a list scheduling algorithms with effective method of priority assignments. The paper also analyzes the worst case performance and optimality condition for the proposed algorithm. The performance comparison study shows that the proposed algorithms outperforms existing scheduling algorithms especially for input DAGs with high communication overheads. The performance improvement over existing algorithms becomes larger as the input DAG becomes more dense and the level of parallelism in the DAG is increased.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.15-27
• /
• 1998

In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each Processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.16-19
• /
• 2007

At an integrated steel mill, raw materials such as coal and iron ore are discharged by ships through multiple unloaders. The discharged raw material is then transported to storage yards through multiple routes established simultaneously on a fairly complicated belt conveyer network. Formulating an efficient unloading schedule is a quite cumbersome task due to the insufficient number of berths and unloaders as well as the potential conflict among routes being used simultaneously. In this paper, we propose a solution approach to the scheduling problem and describe the prototype system that we built as an implementation of our approach.