• Title/Summary/Keyword: System Delay

Search Result 4,472, Processing Time 0.029 seconds

Cache memory system for high performance CPU with 4GHz (4Ghz 고성능 CPU 위한 캐시 메모리 시스템)

  • Jung, Bo-Sung;Lee, Jung-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.2
    • /
    • pp.1-8
    • /
    • 2013
  • TIn this paper, we propose a high performance L1 cache structure on the high clock CPU of 4GHz. The proposed cache memory consists of three parts, i.e., a direct-mapped cache to support fast access time, a two-way set associative buffer to exploit temporal locality, and a buffer-select table. The most recently accessed data is stored in the direct-mapped cache. If a data has a high probability of a repeated reference, when the data is replaced from the direct-mapped cache, the data is selectively stored into the two-way set associative buffer. For the high performance and low power consumption, we propose an one way among two ways set associative buffer is selectively accessed based on the buffer-select table(BST). According to simulation results, Energy $^*$ Delay product can improve about 45%, 70% and 75% compared with a direct mapped cache, a four-way set associative cache, and a victim cache with two times more space respectively.

A Distributed Conference Architecture with a New Load Control Method (새로운 부하 제어 방식을 사용한 분산형 컨퍼런스 구조)

  • Jang, Choon-Seo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.67-73
    • /
    • 2012
  • A distributed conference architecture with a new load control method has been suggested in this paper. A new event package in this paper enables to control conference load. Some additional elements for exchanging SIP messages between server and participants, and for distributing the load, have been added to new conference information data format. Furthermore to lessen the load, all conference servers share the processing of conference information data which should be transferred periodically to all participants. The suggested load control event package makes each server can get current load status of the overall servers. When load increases in one server SIP client requests are distributed by selecting a server which has the lowest load value, or new server is created to share the load. The performance of the proposed system has been evaluated by experiments. They shows 21.6% increase in average delay time, and 29.2% increase in average SIP message processing time.

A Geographic Distributed Hash Table for Virtual Geographic Routing in MANET (MANET에서 가상 위치 기반 라우팅을 위한 지역 분산 해쉬 테이블 적용 방법)

  • Ko, Seok-Kap;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.12
    • /
    • pp.58-65
    • /
    • 2008
  • This paper presents a new geographic distributed hash table (GDHT) for MANETs or Mesh networks, where virtual geographic protocol is used. In previous wort GDHT is applied to a network scenario based on two dimensional Cartesian coordinate system. Further, logical data space is supposed to be uniformly distributed. However, mobile node distribution in a network using virtual geographic routing is not matched to data distribution in GDHT. Therefore, if we apply previous GDHT to a virtual geographic routing network, lots of DHT data are probably located at boundary nodes of the network or specific nodes, resulting in long average-delay to discover resource (or service). Additionally, in BVR(Beacon Vector Routing) or LCR(Logical Coordinate Routing), because there is correlation between coordinate elements, we cannot use normal hash function. For this reason, we propose to use "geographic hash function" for GDHT that matches data distribution to node distribution and considers correlation between coordinate elements. We also show that the proposed scheme improves resource discovery efficiently.

Experimental Study on Characteristics of Evaporation Heat Transfer and Oil Effect of $CO_2$ in Mini-channels (미세채널 내 이산화탄소의 증발 열전달 특성 및 오일의 영향에 관한 실험적 연구)

  • Lee, Sang-Jae;Kim, Dae-Hoon;Choi, Jun-Young;Lee, Jae-Heon;Kwon, Young-Chul
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.21 no.1
    • /
    • pp.16-22
    • /
    • 2009
  • In order to investigate $CO_2$ heat transfer coefficient and pressure drop by PAG oil concentration during $CO_2$ evaporation, the experiment on evaporation heat transfer characteristics in a mini-channels were performed. The experimental apparatus consisted of a test section, a DC power supply, a heater, a chiller, a mass flow meter, a pump and a measurement system. Experiment was conducted for various mass fluxes($300{\sim}800kg/m^{2}s$), heat fluxes($10{\sim}40kW/m^2$) saturation temperatures($-5{\sim}5^{\circ}C$), and PAG oil concentration(0, 3, 5wt%). The variation of the heat transfer coefficient was different according to the oil concentration. With the increase of the oil concentration, the evaporation heat transfer coefficient decreased and the delay of dryout by oil addition was found. Pressure drop increased with the increase of the oil concentration and heat flux, and the decrease of saturation temperature.

Performance Evaluation of Finite Field Arithmetic Implementations in Network Coding (네트워크 코딩에서의 유한필드 연산의 구현과 성능 영향 평가)

  • Lee, Chul-Woo;Park, Joon-Sang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.2
    • /
    • pp.193-201
    • /
    • 2008
  • Using Network Coding in P2P systems yields great benefits, e.g., reduced download delay. The core notion of Network Coding is to allow encoding and decoding at intermediate nodes, which are prohibited in the traditional networking. However, improper implementation of Network Coding may reduce the overall performance of P2P systems. Network Coding cannot work with general arithmetic operations, since its arithmetic is over a Finite Field and the use of an efficient Finite Field arithmetic algorithm is the key to the performance of Network Coding. Also there are other important performance parameters in Network Coding such as Field size. In this paper we study how those factors influence the performance of Network Coding based systems. A set of experiments shows that overall performance of Network Coding can vary 2-5 times by those factors and we argue that when developing a network system using Network Coding those performance parameters must be carefully chosen.

  • PDF

Design of a User Location Prediction Algorithm Using the Flexible Window Scheme (Flexible Window 기법을 이용한 위치 예측 알고리즘 설계)

  • Son, Byoung-Hee;Kim, Yong-Hoon;Nahm, Eui-Seok;Kim, Hag-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6A
    • /
    • pp.550-557
    • /
    • 2007
  • We predict a context of various structures by using Bayesian Networks Algorithms, Three-Dimensional Structures Algorithms and Genetic Algorithms. However, these algorithms have unavoidable problems when providing a context-aware service in reality due to a lack of practicality and the delay of process time in real-time environment. As far as context-aware system for specific purpose is concerned, it is very hard to be sure about the accuracy and reliability of prediction. This paper focuses on reasoning and prediction technology which provides a stochastic mechanism for context information by incorporating various context information data. The objective of this paper is to provide optimum services to users by suggesting an intellectual reasoning and prediction based on hierarchical context information. Thus, we propose a design of user location prediction algorithm using sequential matching with n-size flexible window scheme by taking user's habit or behavior into consideration. This algorithm improves average 5.10% than traditional algorithms in the accuracy and reliability of prediction using the Flexible Window Scheme.

An Approach for Multi-User Multimedia Requests Service to Overlay Multicast Trees (다중 사용자의 멀티미디어 요구 서비스를 위한 오버레이 멀티캐스트 트리의 구성과 복구 방안)

  • Kang, Mi-Young;Yang, Hyun-Jong;Nam, Ji-Seung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12B
    • /
    • pp.1058-1065
    • /
    • 2008
  • In the Internet, as computer resource is developed, multimedia data request being increase more and more. It is effective way that process both high capacity-data and real-time data. Overlay Multicast is an effective method for efficient utilization of system resources and network bandwidth without using hardware customization. Overlay Multicast is an effective method for multimedia data service to multi-users. Multicast tree reconstruction is required when a non-leaf host leaves or fails. In this paper, relay-frame interval is selected as revealed network-state with jitter. In our proposal, multi-user service control algorithm gives a delay effect in multimedia request time. The simulation results show that our proposal takes shorter period of time than the other algorithms to reconstruct a similar tree and that it is a more effective way to deal with a lot of nodes that have lost their multi-user nodes.

An I/Q Channel 12bit 40MS/s Pipeline A/D Converter with DLL Based Duty-Correction Circuit for WLAN (DLL 기반의 듀티 보정 회로를 적용한 무선랜용 I/Q 채널 12비트 40MS/s 파이프라인 A/D변환기)

  • Lee, Jae-Yong;Cho, Sung-Il;Park, Hyun-Mook;Lee, Sang-Min;Yoon, Kwang-Sub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5C
    • /
    • pp.395-402
    • /
    • 2008
  • In this paper, an I/Q channel 12bits 40MS/s Pipeline Analog to Digital Converter that is able to apply to WLAN/WMAN system is proposed. The proposed ADC integrates DLL based duty-correction circuit which corrects the fluctuations in the duksty cycle caused by miniaturization of CMOS devices and faster operating speeds. It is designed as a 1% to 99% input clock duty cycle could be corrected to 50% output duty cycle. The prototype ADC is implemented in a $0.18{\mu}m$ CMOS n-well 1-poly 6-metal process and dissipates 184mW at 1.8V single supply The SNDR of the proposed 12bit ADC is 52dB and SFDR of 59dBc(@Fs=20MHz, Fin=1MHz) is measured.

Compensation of the Error Rate for the Non-invasive Sphygmomanometer System Using a Tactile Sensor

  • Jeong, In-Cheol;Choi, Yoo-Nah;Yoon, Hyung-Ro
    • Journal of Electrical Engineering and Technology
    • /
    • v.2 no.1
    • /
    • pp.136-141
    • /
    • 2007
  • The Purpose Of This Paper Is To Use A Tactile Sensor To Compensate The Error Rate. Most Automated Sphygmomanometers Use The Oscillometric Method And Characteristic Ratio To Estimate Systolic And Diastolic Blood Pressure. However, Based On The Fact That Maximum Amplitude Of The Oscillometric Waveform And Characteristic Ratio Are Affected By Compliance Of The Aorta And Large Arteries, A Method To Measure The Artery Stiffness By Using A Tactile Sensor Was Chosen In Order To Integrate It With The Sphygmomanometer In The Future Instead Of Using Photoplethysmography. Since Tactile Sensors Have Very Weak Movements, Efforts Were Made To Maintain The Subject's Arm In A Fixed Position, And A 40hz Low Pass Filter Was Used To Eliminate Noise From The Power Source As Well As High Frequency Noise. An Analyzing Program Was Made To Get Time Delay Between The First And Second Peak Of The Averaged Digital Volume Pulse(${\Delta}t_{dvp}$), And The Subject's Height Was Divided By ${\Delta}t_{dvp}$ To Calculate The Stiffness Index Of The Arteries($Si_{dvp}$). Regression Equations Of Systolic And Diastolic Pressure Using $Si_{dvp}$ And Mean Arterial Pressure(Map) Were Computed From The Test Group (60 Subjects) Among A Total Of 121 Subjects(Age: $44.9{\pm}16.5$, Male: Female=40:81) And Were Tested In 61 Subjects To Compensate The Error Rate. Error Rates Considering All Subjects Were Systolic $4.62{\pm}9.39mmhg$, And Diastolic $14.40{\pm}9.62mmhg$, And Those In The Test Set Were $3.48{\pm}9.32mmhg,\;And\;14.34{\pm}9.67mmhg$ Each. Consequently, Error Rates Were Compensated Especially In Diastolic Pressure Using $Si_{dvp}$, Various Slopes From Digital Volume Pulse And Map To Systolic-$1.91{\pm}7.57mmhg$ And Diastolic $0.05{\pm}7.49mmhg$.

The injection petrol control system about CMAC neural networks (CMAC 신경회로망을 이용한 가솔린 분사 제어 시스템에 관한 연구)

  • Han, Ya-Jun;Tack, Han-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.2
    • /
    • pp.395-400
    • /
    • 2017
  • The paper discussed the air-to-fuel ratio control of automotive fuel-injection systems using the cerebellar model articulation controller(CMAC) neural network. Because of the internal combustion engines and fuel-injection's dynamics is extremely nonlinear, it leads to the discontinuous of the fuel-injection and the traditional method of control based on table look up has the question of control accuracy low. The advantages about CMAC neural network are distributed storage information, parallel processing information, self-organizing and self-educated function. The unique structure of CMAC neural network and the processing method lets it have extensive application. In addition, by analyzing the output characteristics of oxygen sensor, calculating the rate of fuel-injection to maintain the air-to-fuel ratio. The CMAC may easily compensate for time delay. Experimental results proved that the way is more good than traditional for petrol control and the CMAC fuel-injection controller can keep ideal mixing ratio (A/F) for engine at any working conditions. The performance of power and economy is evidently improved.