• Title/Summary/Keyword: The Priority

Search Result 6,495, Processing Time 0.043 seconds

Project Priority for Community Focusing on the Residents

  • Oh, Youngkyun
    • International Journal of Contents
    • /
    • v.15 no.3
    • /
    • pp.47-54
    • /
    • 2019
  • The purpose of this study is to explore the factors affecting the community well-being of residents through empirical analysis. Rather than just identifying the variables that promote residents' subjective happiness, we focused on factors affecting residents' living condition. In order to empirically investigate the influencing factors, we constructed the analysis data using the Gyeonggi-do survey. We analyzed it by using linear regression analysis. Through the effects of influencing factor analyzed, we could find implications for public project's priority in budget distribution. It could be suggested that local public projects for residents should be focused on improving programs such as job satisfaction, resident health, and neighborhood relations in order to effectively raise community well-being level.

Performance Improvement of Soft Real-Time Scheduler in OSF/1 (OSF/1 기반 SRT 스케쥴러의 성능 향상)

  • Lee, Seung-Ho;Heu, Shin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.246-254
    • /
    • 1997
  • This paper proposes an improved scheduling model and algorithm which threads in the fixed-priority policy have faster response time and turnaround time than existing ones in SRT system. Sub run queue is added into the system and is used for the quick execution and aging of threads in the fixed-priority policy. Using simulation two method are compared. The results shows that the new scheduling model gets threads in the fixed-priority policy to run faster than existing ones.

  • PDF

A Study on Deciding Priority of Optimal Design Guide for Disassembly Process (분리공정 개선을 위한 설계 가이드 우선순위 결정방법론)

  • Mok, Hak-Soo;Lee, Jae-Sung;Cho, Jong-Rae
    • IE interfaces
    • /
    • v.17 no.4
    • /
    • pp.414-425
    • /
    • 2004
  • This study presents the decision of priority for optimal design guide to improve disassembly process. Disassembly process is divided into recognition, transfer and disassembly of assembly point and recognition, transfer and remove of grasp point. Significant influential factors are derived from analyzing the above process. And those factors are used for making the check list to evaluate the properties of parts in each process. Furthermore, the weight with considering disassembly process is also used to determine weight of each process. On the base of the above sequence, qualitative score of disassemblability of each process that is enabled to compare different disassembly processes can be acquired. Ultimately the score helps to decide the priority of design guide for disassembly process.

A Comparitive Study of MAUT and AHP in Priority Setting of R&B Projects (연구개발사업 우선순위 설정에 있어서 다속성효용이론(MAUT)과 계층분석과정(AHP)의 비교)

  • 박주형;김정흠
    • Journal of Korea Technology Innovation Society
    • /
    • v.2 no.2
    • /
    • pp.201-218
    • /
    • 1999
  • The article contains an introduction of possibility of applying Multi-Attribute Utility Theory(MAUT) for priority setting of R&D projects. MAUT is compared with AHP, which is widely used recently. These two techuiques are applied to set priorities of R&D projects In a Government-funded Research Institute. Six criteria are chosen from consultation with decision makers. They are composed of 1) validity as representative projects, 2) possibility of resource mobilization, 3) spillover effect of developed technologies, 4) possibility of success, 5) scope of participation and 6) clarity of research goal. To set priorities of R&D projects, SMART(Simple MultiAttribute Rating Technique) and DVM(Difference Value Measurement) out of many MAUT methods are used to design the utility function and to determine the weights among criteria. The aggregation model is additive on the assumption the criteria are independent. AHP executes pairwise comparisons for criteria and alternatives. From the results of the case study, the results and theoretical characteristics are compared.

  • PDF

Overload control of SCP in intelligne netowrk with fairness and priority (지능망 구조에서 공정성과 우선순위를 보장하는 과부하 제어 연구)

  • Lee, Yong;Song, Joo-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.12
    • /
    • pp.3098-3108
    • /
    • 1996
  • This paper proposed two mechanisms of fixed method and new arrival method. They are all interactive meachanisms in that a SCP and the SSPs exchange load information for overload control. These mechanisms using simple algorithm based on the standard ACG, apply differenct call gapping time on each SSP under the fairness scheme when they allocates SCP capacity to competing demends. Also in the mechanisms, priority scheme is implemented. Two mechanisms show the almost same results on the call throughput. Fairness about the probability of rejection is maintained same value on all SSPs. On Priority scheme, new arrival method has better achievement than fixed method.

  • PDF

Development of a Methodology for Setting Priority of Technology Alternatives (기술대체안의 우선순위 설정을 위한 개량 AHP모형의 개발)

  • Gwon, Cheol-Shin;Cho, Keun-Tae
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.122-125
    • /
    • 2000
  • The Analytic Hierarchy Process (AHP), a decision making model, which is more applicable than other methods to R&D project selection, particularly when it is applied to intangibles. The objective of this paper is to develop an extended model of the AHP which Is linked to Cross Impact Analysis to assist in the ranking of a large number of technological alternatives. In this study, we developed a priority setting algorithm which considers the cross-impact of the future technology alternatives and thus developed an integrated cross-impact hierarchical decision-making model, which sets the priority by considering technological forecasting and technology dependency

  • PDF

System Software Modeling Based on Dual Priority Scheduling for Sensor Network (센서네트워크를 위한 Dual Priority Scheduling 기반 시스템 소프트웨어 모델링)

  • Hwang, Tae-Ho;Kim, Dong-Sun;Moon, Yeon-Guk;Kim, Seong-Dong;Kim, Jung-Guk
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.2 no.4
    • /
    • pp.260-273
    • /
    • 2007
  • The wireless sensor network (WSN) nodes are required to operate for several months with the limited system resource such as memory and power. The hardware platform of WSN has 128Kbyte program memory and 8Kbytes data memory. Also, WSN node is required to operate for several months with the two AA size batteries. The MAC, Network protocol, and small application must be operated in this WSN platform. We look around the problem of memory and power for WSN requirements. Then, we propose a new computing model of system software for WSN node. It is the Atomic Object Model (AOM) with Dual Priority Scheduling. For the verification of model, we design and implement IEEE 802.15.4 MAC protocol with the proposed model.

  • PDF

Traffic Control with Double Threshold in ATM Networks (이중 문턱값 설정에 의한 ATM망의 트래픽 제어기법)

  • 정상국;진용옥
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.8
    • /
    • pp.1475-1484
    • /
    • 1994
  • In this paper, a priority scheduling algorithm with double threshold and a traffic control mechanism with hysteresis effect are proposed. The double threshold priority scheduling is studied based on HOL and QLT. The hysteresis effect traffic control is specified by hysteresis effect QLT and traffic rate control. According to the simulation results, it can be shown that the proposed dynamic priority scheduling brings better processing performance than the existing QLT algorithm. And the results demonstrate that QLT and traffic rate control with hysteresis effect enhance the performance in comparison with those of single threshold.

  • PDF

Guaranteed Dynamic Priority Assignment Schemes for Real-Time Tasks with (m, k)-Firm Deadlines

  • Cho, Hyeon-Joong;Chung, Yong-Wha;Park, Dai-Hee
    • ETRI Journal
    • /
    • v.32 no.3
    • /
    • pp.422-429
    • /
    • 2010
  • We present guaranteed dynamic priority assignment schemes for multiple real-time tasks subject to (m, k)-firm deadlines. The proposed schemes have two scheduling objectives: providing a bounded probability of missing (m, k)-firm constraints and maximizing the probability of deadline satisfactions. The second scheduling objective is especially necessary in order to provide the best quality of service as well as to satisfy the minimum requirements expressed by (m, k)-firm deadlines. We analytically establish that the proposed schemes provide a guarantee on the bounded probability of missing (m, k)-firm constraints. Experimental studies validate our analytical results and confirm the effectiveness and superiority of the proposed schemes with regard to their scheduling objectives.

Delay Fairness Using the Burst Assembly for Service Differentiation

  • Vo, Viet Minh Nhat;Le, Van Hoa;Le, Manh Thanh
    • ETRI Journal
    • /
    • v.40 no.3
    • /
    • pp.347-354
    • /
    • 2018
  • Using various offset times to separate differential services is the most common form of service differentiation in optical burst switching networks. In this approach, a larger offset time is given to a higher priority burst, but it causes this burst to have a longer delay. One solution to this problem is to adjust the burst assembly time so that the buffering delay of the higher priority burst is always shorter than that of the lower priority burst. However, this adjustment causes another problem, called delay unfairness, for bursts with differential priorities that share the same path to their destination. This article proposes a new solution for delay fairness using the burst assembly.