• Title, Summary, Keyword: set priority

Search Result 415, Processing Time 0.037 seconds

User Task Management System based on Device Priority (기기 우선순위 기반 사용자 작업관리 시스템)

  • Jang, Kiman;Jeong, Dohyeong;Jung, Hoekyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.3
    • /
    • pp.657-662
    • /
    • 2017
  • Recently, according to the development of the smart home field, it provides a service to install and keep the smart home appliance in a user's residential environment pleasantly. However, the conventional system method has a problem in that it is not convenient because the user selects a device or manually operates the device. In this paper, we propose a system to set the priority of the devices selected by the user and proceed with the work. When a user selects a device, it recommends a device associated with the device. Compare and set the priority of each device. And it is a system that carries out work according to the set priority. Therefore the proposed system is expected to provide users with increased convenience and efficiency of work management.

Bandwidth-Award Bus Arbitration Method (점유율을 고려한 버스중재 방식)

  • Choi, Hang-Jin;Lee, Kook-Pyo;Yoon, Yung-Sup
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.5
    • /
    • pp.80-86
    • /
    • 2010
  • The conventional bus system architecture consists of masters, slaves, arbiter, decoder and so on in shared bus. As several masters can't use a bus concurrently, arbiter plays an role in arbitrating the bus. The efficiency of bus usage can be determined by the selection of arbitration method. Fixed Priority, Round-Robin, TDMA and Lottery arbitration policies are studied in the conventional arbitration method where the bus priority is primarily considered. In this paper, we propose the arbitration method that calculates the bus utilization of each master. Furthermore, we verify the performance compared with the other arbitration methods through TLM(Transaction Level Model). From the results of performance verification, the arbitration methods of Fixed Priority and Round-Robin can not set the bus utilization and those of TDMA and Lottery happen the error of 50% and 70% respectively compared with bus utilization set by user in more than 100,000 cycles. On the other hand, the bandwidth-award bus arbitration method remains the error of less than 1% since approximately 1000 cycles, compared with bus utilization set by user.

An application of Important-Performance Analysis to set the service improvement priority in hospital (병원의 서비스개선 우선순위 설정을 위한 IPA 적용)

  • Youn, Kyung-Il
    • Korea Journal of Hospital Management
    • /
    • v.14 no.2
    • /
    • pp.21-40
    • /
    • 2009
  • The importance-performance analysis (IPA) is a widely used analytical technique that produces a priority of managerial attention for the customer satisfaction. This study attempted to compare various different approaches of IPA such as direct and indirect measurement of importance, and traditional four quadrants grid model and diagonal grid model of IPA. Data on 17 inpatient service quality attributes were collected from 234 inpatients of a general hospital. Eight IPA grids were produced to compare the result of each model. Based on the study results the strength and weakness of each model were discussed, and a set of recommendations for practical application of the IPA in hospital settings was suggested.

  • PDF

A Bayesian Approach for Solving Goal Programs Having Probabilistic Priority Structure

  • Suh Nam-Soo
    • Journal of the military operations research society of Korea
    • /
    • v.15 no.1
    • /
    • pp.44-53
    • /
    • 1989
  • This paper concerns with the case of having a goal program with no preassigned deterministic ranking for the goals. The priority ranking in this case depends on the states of nature which are random variables. The Bayesian approach is performed to obtain the nondominated set of rankings.

  • PDF

Bus Arbitration Policy Using Random Function Manager (랜덤함수 매니저를 이용한 버스중재 방식)

  • Lee, Kook-Pyo;Yoon, Yung-Sup
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.11
    • /
    • pp.34-39
    • /
    • 2009
  • In this study, we have proposed the random function arbitration method using a random function manager in other to use the merits and overcome the demerits of fixed priority and round-robin, Starvation phenomenon can be generated from the master having low priority in fixed priority method. Also, round-robin method can't give a priority to important master, however, as the proposed random function arbitration method can be random set the rate of fixed priority and round-robin, we can solve the problems of conventional arbitration methods. From TLM simulation, we confirmed that the bus utilization of master could be controled from 32% to 16% and the starvation phenomenon of master could be prevented.

Enhancing Fixed Priority Scheduling Algorithms for Real-Time Tasks on Multiprocessors (다중처리기 상의 실시간 태스크를 위한 고정 우선순위 스케줄링 알고리즘의 성능 향상)

  • Park Minkyu;Han Sangchul;Kim HeeHeon;Cho Seongje;Cho Yookun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.1
    • /
    • pp.62-68
    • /
    • 2005
  • This paper presents a scheme to enhance fixed priority scheduling algorithms on multiprocessors. This scheme gives the highest priority to jobs with zero laxity and schedules them Prior to other jobs. A fixed priority algorithm employing this scheme strictly dominates the original one; it can schedule all task sets schedulable by the fixed priority algorithm and some task sets not schedulable by the fixed priority algorithm. Simulation results show that the proposed scheme improves fixed priority algorithms in terms of the number of schedulable task sets and schedulable utilization bound.

OPTIMAL PERIOD AND PRIORITY ASSIGNMENT FOR A NETWORKED CONTROL SYSTEM SCHEDULED BY A FIXED PRIORITY SCHEDULING SYSTEM

  • Shin, M.;SunWoo, M.
    • International Journal of Automotive Technology
    • /
    • v.8 no.1
    • /
    • pp.39-48
    • /
    • 2007
  • This paper addresses the problem of period and priority assignment in networked control systems (NCSs) using a fixed priority scheduler. The problem of assigning periods and priorities to tasks and messages is formulated as an optimization problem to allow for a systematic approach. The temporal characteristics of an NCS should be considered by defining an appropriate performance index (PI) which represents the temporal behavior of the NCS. In this study, the sum of the end-to-end response times required to process all I/Os with precedence relationships is defined as a PI. Constraints are derived from the task and message deadline requirements to guarantee schedulability. Genetic algorithms are used to solve this constrained optimization problem because the optimization formulation is discrete and nonlinear. By considering the effects of communication, an optimum set of periods and priorities can be holistically derived.

An Extensible Transaction Model for Real-Time Data Processing (실시간 데이타 처리를 위한 확장 가능한 트랜잭션 모델에 관한 연구)

  • 문승진
    • Journal of Internet Computing and Services
    • /
    • v.1 no.2
    • /
    • pp.11-18
    • /
    • 2000
  • In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.

  • PDF

Performance Analysis of Bandwidth-Aware Bus Arbitration (밴드위스 고려 버스중재방식의 성능분석)

  • Lee, Kook-Pyo;Yoon, Yung-Sup
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.9
    • /
    • pp.50-57
    • /
    • 2011
  • Conventional bus system architectures are composed of several components such as master, arbiter, decoder and slave modules. The arbiter plays a role in bus arbitration according to the selected arbitration method, since several masters cannot use the bus concurrently. Typical priority strategies used in high performance arbiters include static priority, round robin, TDMA and lottery. Typical arbitration algorithms always consider the bus priority primarily, while the bus utilization is always ignored. In this paper, we propose an arbitration method using bus utilization for the operating block of each master. We verify the performance compared with the other arbitration methods through the TLM(Transaction Level Model). Based on the performance verification, the conventional fixed priority and round-robin arbitration methods cannot set the bus utilization. Whereas, in the case of the conventional TDMA and lottery arbitration methods, more than 100,000 cycles of bus utilization can be set by the user, exhibiting differences of actual bus utilization up to 50% and 70%, respectively. On the other hand, we confirm that for the proposed arbitration method, the matched bus utilization set by the user was above 99% using approximately 1,000 cycles.

Selection of Manageable Diseases for Quality Assessment in Korean Medicine by Delphi Method (한방분야 적정성 평가 대상 질환 선정을 위한 전문가 Delphi 조사)

  • Park, Chang-Hyun;Lim, Hyung-Ho
    • Journal of Korean Medicine Rehabilitation
    • /
    • v.26 no.3
    • /
    • pp.129-141
    • /
    • 2016
  • Objectives As awareness of the public about Korean medicine health care and the social demand about improvement for quality of health care service is constantly rising, the quality evaluation of Korean medicine health care service is needed to improve the quality. Through trial of Delphi method, we tried to set the priority in short, medium, long term among the disease which is the subject of quality assessment. Methods Carrying out the delphi survey to 50 experts of korean medicine who were recommended by the 41 member societies of Korean medicine and related organizations, we selected final candidates for quality assessment. It is composed with total 2 rounds, and we investigated the priority in three aspects; the importance of the matter, possibility quality assessment, potential about if there's any chance of improvement. Results By delphi method, we set the priority of quality assessment. Base on the result of the second round, we classified importance of the questions into above average, average, below average, and categorized items as short, medium, long term according on the final priority. We classified of musculoskeletal diseases and diseases of connective tissues and musculoskeletal injury as short term and cerebrovascular disease and disease of nerve system and malignant neoplasm as medium term, disease of digestive organs and diseases, symptoms and abnormal findings in clinical field or inspections which are not categorized as long term. Conclusions We set the subjects of quality assessment by delphi survey by experts, and classified into short, medium, long term. Further research is necessary for execution the Quality Assessment to each of the candidate. Also, we can send feedback to medical institution base on the result of Quality Assessment. then it would be able to induce the improvement in quality of medical institution by itself.