• Title/Summary/Keyword: scheduling delay

Search Result 510, Processing Time 0.025 seconds

Task-Level Dynamic Voltage Scaling for Embedded System Design: Recent Theoretical Results

  • Kim, Tae-Whan
    • Journal of Computing Science and Engineering
    • /
    • v.4 no.3
    • /
    • pp.189-206
    • /
    • 2010
  • It is generally accepted that dynamic voltage scaling (DVS) is one of the most effective techniques of energy minimization for real-time applications in embedded system design. The effectiveness comes from the fact that the amount of energy consumption is quadractically proportional to the voltage applied to the processor. The penalty is the execution delay, which is linearly and inversely proportional to the voltage. According to the granularity of tasks to which voltage scaling is applied, the DVS problem is divided into two subproblems: inter-task DVS problem, in which the determination of the voltage is carried out on a task-by-task basis and the voltage assigned to the task is unchanged during the whole execution of the task, and intra-task DVS problem, in which the operating voltage of a task is dynamically adjusted according to the execution behavior to reflect the changes of the required number of cycles to finish the task before the deadline. Frequent voltage transitions may cause an adverse effect on energy minimization due to the increase of the overhead of transition time and energy. In addition, DVS needs to be carefully applied so that the dynamically varying chip temperature should not exceed a certain threshold because a drastic increase of chip temperature is highly likely to cause system function failure. This paper reviews representative works on the theoretical solutions to DVS problems regarding inter-task DVS, intra-task DVS, voltage transition, and thermal-aware DVS.

A Weighted Fair Queuing Scheduler Guaranteeing Differentiated Packet Loss Rates (차별화된 패킷 손실률을 보장하는 가중치 기반 공정 큐잉 스케줄러)

  • Kim, Tae Joon
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.12
    • /
    • pp.1453-1460
    • /
    • 2014
  • WFQ (Weighted Fair Queuing) provides not only fairness among traffic flows in using bandwidth but also guarantees the Quality of Service (QoS) that individual flow requires, which is why it has been applied to the resource reservation protocol (RSVP)-capable router. The RSVP allocates an enough resource to satisfy both the rate and end-to-end delay requirements of the flow in the condition of no packet loss, and the WFQ scheduler guarantees those QoS requirements with the allocated resource. In practice, however, most QoS-guaranteed services allow a degree of packet loss, especially from 0.1% to 3% for Voice over IP. This paper discovers that the packet loss rate of each traffic flow is determined by only its time-stamp adjustment value, and then enhances the WFQ to provide a differentiated packet loss guarantee under general traffic conditions in terms of both traffic characteristics and QoS requirements. The performance evaluation showed that the proposed WFQ could increase the utilization of bandwidth by 8~11%.

Design and Implementation of a Genetic Algorithm for Circuit Partitioning (회로 분할 유전자 알고리즘의 설계와 구현)

  • 송호정;송기용
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.4
    • /
    • pp.97-102
    • /
    • 2001
  • In computer-aided design, partitioning is task of clustering objects into groups to that a given objection function is optimized It is used at the layout level to fin strongly connected components that can be placed together in order to minimize the layout area and propagation delay. Partitioning can also be used to cluster variables and operation into groups for scheduling and unit selection in high-level synthesis. The most popular algorithms partitioning include the Kernighan-Lin algorithm Fiduccia-Mattheyses heuristic and simulated annealing In this paper we propose a genetic algorithm searching solution space for the circuit partitioning problem. and then compare it with simulated annealing by analyzing the results of implementation.

  • PDF

An adaptable polling scheme for real time traffic support in IEEE 802.11 networks

  • Pak Jin-suk;Son Jae-min;Cho Chi-woo;Lee Ho-seung;Han Ki-jun
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.313-316
    • /
    • 2004
  • This paper presents a new dynamically adaptable polling scheme for efficient support of real-time traffic over an IEEE 802.11 wireless LAN network. The poll scheduling plays an important role in IEEE 802.11 PCF. However, the current version of the polling list management scheme proposed in the IEEE802.11 standard is inefficient when a variable number of mobile stations have variable packets to transmit. If Point Coordinator(PC) has an exact information on the station status, it is possible to efficiently perform polling. In this thesis. we suggest an adaptable polling scheme to meet requirements of the stations. In our scheme, each station transmits packets including a piggyback information to inform that it wants to receive a poll in the next polling duration. Simulation results indicate that our scheme may reduces the packet discard ratio and real-time packet transfer delay.

  • PDF

Application of Methods of Management Science in Care Process Management (의료프로세스 관리에 경영과학적 접근방법의 응용)

  • Kim, Tae Hyun
    • Korea Journal of Hospital Management
    • /
    • no.spc
    • /
    • pp.1-13
    • /
    • 2016
  • In a situation where competition becomes intense, health care organizations constantly strive to provide more services with given personnel and time. While not only the 'quantity' of the services but also the 'quality' becomes increasingly important, various problems that can occur during the 'process' of service provision can be effectively managed by applying the methods of management science. In this study, we introduce the cases where the methods of management science can be applied for the management of health care organizations in Korea and abroad. There are many cases where various scenarios for improving the patients' accessibility to the services and for maximizing the efficient use of limited resources are established, and simulation or basic statistical analysis methods are used to solve the problems more systematically or to develop improvement plans. In this study, several exemplary cases, such as no-show of patients, crowding in the emergency room, prediction of the number of available beds in the intensive care units, nurse scheduling, delay of arrival of patients, and ordering of the proper amount of therapeutic materials, are introduced and discussed. From the perspective of administrators or clinicians, however, it may not be easy to master the methodology that requires considerable mathematical background or apply the theories to practice directly. Therefore, it is suggested that more practical and relatively simple analytical methods should be applied. Also, having a more positive attitude toward improving the current performance (e.g., a belief that 'we can always be better than now'), and paying attention to improving the job satisfaction by addressing problems, with experimental spirit and data-driven decision management.

Interrelation Based Resource Allocation Scheme for Mobile Multimedia Networks (이동 멀티미디어 망을 위한 상호관계기반 자원 할당 방법)

  • Lee, Jong-Chan;Lee, Moon-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.8
    • /
    • pp.79-87
    • /
    • 2010
  • It is widely accepted that the coverage with high user densities in mobile multimedia environments can only be achieved with small cell such as micro- and pico-cell. If handover events occur during the transmission of multimedia, the efficient resource reservation and handover methods are necessary in order to maintain the same QoS of transmitted multimedia traffic because the QoS may be defected by some delay and information loss. In this paper, we propose a resource allocation method in the next generation mobile communication systems, in which the resource allocation process has a tight relation with call admission, call load, and packet scheduling. The simulation results show that our proposed method provides a excellent performance.

A Review of Large-Scale Hydropower Project in Public Sector of Pakistan

  • Umair, Muhammad;Choudhary, Muhammad Abbas;Jahanzaib, Mirza
    • Journal of Construction Engineering and Project Management
    • /
    • v.4 no.4
    • /
    • pp.47-59
    • /
    • 2014
  • Client organization inadequate project planning before awarding the contract and insufficient monitoring and control system among the parties involved create severe problems. Ultimately, large-scale projects go beyond the expected cost and time control limits. This paper discusses the major issues involved with a large-scale Hydropower Project in Pakistan Public Sector environment. The latest approved Baseline Plan of project was reviewed and analyzed using Variance Analysis and Trend Analysis techniques in Primavera project management software to assess the efforts made of the parties involved. It was found that Project is 202% Cost overrun and 25% time delays from original contract award. After analysis of baseline plan and quantification of various variance issues in impacted activities, the questionnaire survey was conducted to identify the impact of causative factors. There were almost 17 most significant causative factors identified among 60 identified factors and responsibilities are assigned accordingly. At the end recommendations are made for strategic decisions as lessons learned during project evaluation.

Traffic Scheduling using Multi - Thresholds in ATM Networks (ATM망에서 다중 임계를 이용한 트래픽 스케줄링 연구)

  • Kim, Jong-Eun;Ahn, Hyo-Beom;Cho, Kyung-San
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1781-1787
    • /
    • 1997
  • Future high speed networks are expected to use the Asynchronous Transfer Mode(ATM), which provides desired quality of service for the various traffic types(e.g., voice, video and data). Proper traffic control scheme helps ensure efficient and fair operation of networks. In this paper, we analyze various related traffic-control strategies and propose a new traffic control scheme and ATM control architecture with an integrated buffer management method and multi-thresholds in order to solve the problem of each class's cell loss ratio and cell delay in ATM networks. In addition, we evaluate the performance improvement of the proposed traffic control scheme through simulation. As shown in the result, the proposed traffic control scheme improves cell loss ratio in proportion to the buffer size.

  • PDF

A Digital Right Management System based on Shared Key fool for Video Data Protection (동영상 데이터 보호를 위한 공유 키 풀 기반의 DRM 시스템)

  • Kim Jung-Jae;Park Jae-Pyo;Jun Moon-Seog
    • The KIPS Transactions:PartC
    • /
    • v.12C no.2 s.98
    • /
    • pp.183-190
    • /
    • 2005
  • In this thesis, first, we propose I-frame encryption techniques of video data for video data itself encryption and propose license agent that processing user's certification and decryption in client system automatically when user execute encrypted video data in system server. License agent runs user's certification, encryption and decryption of video data based on PID(Public Key Infrastructure) using shared key-pool when execute of video data. Also, compose duplex buffer control and propose real time decryption method using efficient buffer scheduling to reduce much playing delay times that happen processing decryption when execute of videoa data of high-capacity.

An Enhanced Message Priority Mechanism in IEEE 802.11p Based Vehicular Networks

  • Liu, Chang;Chung, Sang-Hwa;Jeong, Han-You;Jung, Ik-Joo
    • Journal of Information Processing Systems
    • /
    • v.11 no.3
    • /
    • pp.465-482
    • /
    • 2015
  • IEEE 802.11p is a standard MAC protocol for wireless access in vehicular environments (WAVEs). If a packet collision happens when a safety message is sent out, IEEE 802.11p chooses a random back-off counter value in a fixed-size contention window. However, depending on the random choice of back-off counter value, it is still possible that less important messages are sent out first while more important messages are delayed longer until sent out. In this paper, we present a new scheme for safety message scheduling, called the enhanced message priority mechanism (EMPM). It consists of the following two components: the benefit-value algorithm, which calculates the priority of the messages depending on the speed, deceleration, and message lifetime; and the back-off counter selection algorithm, which chooses the non-uniform back-off counter value in order to reduce the collision probability and to enhance the throughput of the highly beneficial messages. Numerical results show that the EMPM can significantly improve the throughput and delay of messages with high benefits when compared with existing MAC protocols. Consequently, the EMPM can provide better QoS support for the more important and urgent messages.