• Title/Summary/Keyword: scheduling method

Search Result 1,381, Processing Time 0.043 seconds

A Dual Transcoding Method for Retaining QoS of Video Streaming Services under Restricted Computing Resources (동영상 스트리밍 서비스의 QoS유지를 위한 듀얼 트랜스코딩 기법)

  • Oh, Doohwan;Ro, Won Woo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.7
    • /
    • pp.231-240
    • /
    • 2014
  • Video transcoding techniques provide an efficient mechanism to make a video content adaptive to the capabilities of a variety of clients. However, it is hard to provide an appropriate quality-of-service(QoS) to the clients owing to heavy workload on transcoding operations. In light of this fact, this paper presents the dual transcoding method in order to guarantee QoS in streaming services by maximizing resource usage in a transcoding server equipped with both CPU and GPU computing units. The CPU and GPU computing units have different architectural features. The proposed method speculates workload of incoming transcoding requests and then schedules the requests either to the CPU or GPU accordingly. From performance evaluation, the proposed dual transcoding method achieved a speedup of 1.84 compared with traditional transcoding approach.

A Process Perspective Event-log Analysis Method for Airport BHS (Baggage Handling System) (공항 수하물 처리 시스템 이벤트 로그의 프로세스 관점 분석 방안 연구)

  • Park, Shin-nyum;Song, Minseok
    • The Journal of Bigdata
    • /
    • v.5 no.1
    • /
    • pp.181-188
    • /
    • 2020
  • As the size of the airport terminal grows in line with the rapid growth of aviation passengers, the advanced baggage handling system that combines various data technologies has become an essential element in order to handle the baggage carried by passengers swiftly and accurately. Therefore, this study introduces the method of analyzing the baggage handling capacity of domestic airports through the latest data analysis methodology from the process point of view to advance the operation of the airport BHS and the main points based on event log data. By presenting an accurate load prediction method, it can lead to advanced BHS operation strategies in the future, such as the preemptive arrangement of resources and optimization of flight-carrousel scheduling. The data used in the analysis utilized the APIs that can be obtained by searching for "Korea Airports Corporation" in the public data portal. As a result of applying the method to the domestic airport BHS simulation model, it was possible to confirm a high level of predictive performance.

Positioning using ZigBee and Ultrasound

  • Park, Chan-Sik;Kim, Seung-Beom;Kang, Dong-Youn;Yun, Hee-Hak;Cha, En-Jong;Lee, Sang-Jeong
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.2
    • /
    • pp.217-222
    • /
    • 2006
  • To find a location, GPS has been wildly used. But, it is hard to use in indoor because of very weak signal level. To meet indoor requirements, there have been many studies applying wireless communication networks such as WLAN, UWB and ZigBee. Among these, ZigBee is widely adopted in many WSN applications because it has an advantage of low-power and low-cost. In ZigBee, the RSSI is used as range measurement for ad-hoc network. The RSSI are converted to ranges using the signal attenuation model and these ranges become inputs of positioning methods. The obtained position with RSSI has large error because of its poor accuracy. To overcome this problem, ultrasonic sensors are added in many researches. By measuring the arrival time difference of ZigBee and ultrasound as a range measurement, the precise position can be found. However, there are still many problems: scheduling of beacons to transmit signals in a correct order, addition and synchronization of beacons and low-rate positioning rate. At this paper, an efficient method to solve these problems is proposed. In the proposed method, a node transmits ZigBee and ultrasound signal simultaneously. And beacons find the range with the received signals and send it back to a node with ZigBee. The position is computed in a node with the received ranges. In addition, a new positioning algorithm to solve the risk of the divergence in the linearization method and the singularity problem in the Savarese method is presented. Both static and dynamic experimental results show 0.02m RMS errors with high output rate.

  • PDF

Energy-aware Dynamic Frequency Scaling Algorithm for Polling based Communication Systems (폴링기반 통신 시스템을 위한 에너지 인지적인 동적 주파수 조절 알고리즘)

  • Cho, Mingi;Park, Daejin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.9
    • /
    • pp.1405-1411
    • /
    • 2022
  • Power management is still an important issue in embedded environments as hardware advances like high-performance processors. Power management methods such as DVFS control CPU frequencies in an adaptive manner for efficient power management in polling-based I/O programs such as network communication. This paper presents the problems of the existing power management method and proposes a new power management method. Through this, it is possible to reduce electric consumption by increasing the polling cycle in situations where the frequency of data reception is low, and on the contrary, in situations where data reception is frequent, it can operate at the maximum frequency without performance degradation. After implementing this as a code layer on the embedded board and observing it through Atmel's Power Debugger, the proposed method showed a performance improvement of up to 30% in energy consumption compared to the existing power management method.

A Fast Processor Architecture and 2-D Data Scheduling Method to Implement the Lifting Scheme 2-D Discrete Wavelet Transform (리프팅 스킴의 2차원 이산 웨이브릿 변환 하드웨어 구현을 위한 고속 프로세서 구조 및 2차원 데이터 스케줄링 방법)

  • Kim Jong Woog;Chong Jong Wha
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.4 s.334
    • /
    • pp.19-28
    • /
    • 2005
  • In this paper, we proposed a parallel fast 2-D discrete wavelet transform hardware architecture based on lifting scheme. The proposed architecture improved the 2-D processing speed, and reduced internal memory buffer size. The previous lifting scheme based parallel 2-D wavelet transform architectures were consisted with row direction and column direction modules, which were pair of prediction and update filter module. In 2-D wavelet transform, column direction processing used the row direction results, which were not generated in column direction order but in row direction order, so most hardware architecture need internal buffer memory. The proposed architecture focused on the reducing of the internal memory buffer size and the total calculation time. Reducing the total calculation time, we proposed a 4-way data flow scheduling and memory based parallel hardware architecture. The 4-way data flow scheduling can increase the row direction parallel performance, and reduced the initial latency of starting of the row direction calculation. In this hardware architecture, the internal buffer memory didn't used to store the results of the row direction calculation, while it contained intermediate values of column direction calculation. This method is very effective in column direction processing, because the input data of column direction were not generated in column direction order The proposed architecture was implemented with VHDL and Altera Stratix device. The implementation results showed overall calculation time reduced from $N^2/2+\alpha$ to $N^2/4+\beta$, and internal buffer memory size reduced by around $50\%$ of previous works.

Concurrency Control for Mobile Transactions consisted mainly of Update Operations in Broadcast Environments (방송 환경에서 갱신위주의 이동 트랜잭션을 위한 동시성 제어 방법)

  • Kim, Chi-Yeon;Jung, Min-A
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.4
    • /
    • pp.357-365
    • /
    • 2008
  • Broadcast is a efficient interactive method between a server and mobile clients via wireless channel and broadcast environments are incarnating as various applications. Most studies have been proposed in broadcast environments deal with read-only mobile transactions, many applications are emerging recently that need to manage the update transactions at mobile clients. So we propose a concurrency control for mobile transactions consisted mainly of update operations in broadcast environments. As an optimistic approach is applied for scheduling update transactions, repetitive aborts of update transactions are occur due to conflict between transactions. To solve this problem update transactions must have been executed with distributed manner, but unnecessary aborts are occur as well because of continuous restart. Thus, in this paper we propose a method that transactions are executed distributed manner and can avoid unnecessary aborts of update transactions. Proposed method has no unnecessary uplink and can save resources of mobile client.

  • PDF

Scheduler-based Defense Method against Address Translation Redirection Attack (ATRA) (메모리 주소 변환 공격에 대한 스케줄러 기반의 방어 방법)

  • Jang, Daehee;Jang, Jinsoo;Kim, Donguk;Choi, Changho;Kang, Brent ByungHoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.4
    • /
    • pp.873-880
    • /
    • 2015
  • Since hardware-based kernel-integrity monitoring systems run in the environments that are isolated from the monitored OS, attackers in the monitored OS cannot undermine the security of monitoring systems. However, because the monitoring is performed by using physical addresses, the hardware-based monitoring systems are vulnerable to Address Translation Redirection Attack (ATRA) that manipulates virtual-to-physical memory translations. To ameliorate this problem, we propose a scheduler-based ATRA detection method. The method detects ATRA during the process scheduling by leveraging the fact that kernel scheduler engages every context switch of processes. We implemented a prototype on Android emulator and TizenTV, and verified that it successfully detected ATRA without incurring any significant performance loss.

Hashing Method with Dynamic Server Information for Load Balancing on a Scalable Cluster of Cache Servers (확장성 있는 캐시 서버 클러스터에서의 부하 분산을 위한 동적 서버 정보 기반의 해싱 기법)

  • Hwak, Hu-Keun;Chung, Kyu-Sik
    • The KIPS Transactions:PartA
    • /
    • v.14A no.5
    • /
    • pp.269-278
    • /
    • 2007
  • Caching in a cache sorrel cluster environment has an advantage that minimizes the request and response tine of internet traffic and web user. Then, one of the methods that increases the hit ratio of cache is using the hash function with cooperative caching. It is keeping a fixed size of the total cache memory regardless of the number of cache servers. On the contrary, if there is no cooperative caching, the total size of cache memory increases proportional to the number of cache sowers since each cache server should keep all the cache data. The disadvantage of hashing method is that clients' requests stress a few servers in all the cache servers due to the characteristics of hashing md the overall performance of a cache server cluster depends on a few servers. In this paper, we propose the method that distributes uniformly client requests between cache servers using dynamic server information. We performed experiments using 16 PCs. Experimental results show the uniform distribution o

Location Generalization of Moving Objects for the Extraction of Significant Patterns (의미 패턴 추출을 위한 이동 객체의 위치 일반화)

  • Lee, Yon-Sik;Ko, Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.1
    • /
    • pp.451-458
    • /
    • 2011
  • In order to provide the optimal location based services such as the optimal moving path search or the scheduling pattern prediction, the extraction of significant moving pattern which is considered the temporal and spatial properties of the location-based historical data of the moving objects is essential. In this paper, for the extraction of significant moving pattern we propose the location generalization method which translates the location attributes of moving object into the spatial scope information based on $R^*$-tree for more efficient patterning the continuous changes of the location of moving objects and for indexing to the 2-dimensional spatial scope. The proposed method generates the moving sequences which is satisfied the constraints of the time interval between the spatial scopes using the generalized spatial data, and extracts the significant moving patterns using them. And it can be an efficient method for the temporal pattern mining or the analysis of moving transition of the moving objects to provide the optimal location based services.

Research on the Strategy for Outsourcing in Construction Projects: in Fast-track Project (건설프로젝트에서 전략적 하도급 방안에 관한연구 : 설계시공병행방식 사례를 중심으로)

  • Choi, Soo-Ho;Choi, Hyun-Chul;Choi, Hye-Mi;Kim, Ju-Hyung
    • Journal of the Korea Institute of Building Construction
    • /
    • v.14 no.6
    • /
    • pp.551-559
    • /
    • 2014
  • Fast-tracking was developed as an optimizing method to shorten the duration of construction project in 1960's, and it introduced to Korea in 1999. Since then, many Korean companies have been used fast-tracking for getting economical benefit from shorten duration. However, there were some problems(dispute, delay and cost overrun) because of using inappropriate subcontractor management system. For this reason, previous studies suggested some management models to solve these problems. Unfortunately, however, the models have been had some doubts about reliability, objectivity and possibility of using them on real construction site. Therefore, this study suggests 3 steps of strategic subcontracting method and apply it on real fast-tracking practice(L company) to secure reliability and objectivity. Through this, the method is expected to make up the doubts of previous studies.