• Title/Summary/Keyword: 알고리즘이론

Search Result 1,795, Processing Time 0.072 seconds

A Dynamic Allocation Scheme for Improving Memory Utilization in Xen (Xen에서 메모리 이용률 향상을 위한 동적 할당 기법)

  • Lee, Kwon-Yong;Park, Sung-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.3
    • /
    • pp.147-160
    • /
    • 2010
  • The system virtualization shows interest in the consolidation of servers for the efficient utilization of system resources. There are many various researches to utilize a server machine more efficiently through the system virtualization technique, and improve performance of the virtualization software. These researches have studied with the activity to control the resource allocation of virtual machines dynamically focused on CPU, or to manage resources in the cross-machine using the migration. However, the researches of the memory management have been wholly lacking. In this respect, the use of memory is limited to allocate the memory statically to virtual machine in server consolidation. Unfortunately, the static allocation of the memory causes a great quantity of the idle memory and decreases the memory utilization. The underutilization of the memory makes other side effects such as the load of other system resources or the performance degradation of services in virtual machines. In this paper, we suggest the dynamic allocation of the memory in Xen to control the memory allocation of virtual machines for the utilization without the performance degradation. Using AR model for the prediction of the memory usage and ACO (Ant Colony Optimization) algorithm for optimizing the memory utilization, the system operates more virtual machines without the performance degradation of servers. Accordingly, we have obtained 1.4 times better utilization than the static allocation.

A Policy of Page Management Using Double Cache for NAND Flash Memory File System (NAND 플래시 메모리 파일 시스템을 위한 더블 캐시를 활용한 페이지 관리 정책)

  • Park, Myung-Kyu;Kim, Sung-Jo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.5
    • /
    • pp.412-421
    • /
    • 2009
  • Due to the physical characteristics of NAND flash memory, overwrite operations are not permitted at the same location, and therefore erase operations are required prior to rewriting. These extra operations cause performance degradation of NAND flash memory file system. Since it also has an upper limit to the number of erase operations for a specific location, frequent erases should reduce the lifetime of NAND flash memory. These problems can be resolved by delaying write operations in order to improve I/O performance: however, it will lower the cache hit ratio. This paper proposes a policy of page management using double cache for NAND flash memory file system. Double cache consists of Real cache and Ghost cache to analyze page reference patterns. This policy attempts to delay write operations in Ghost cache to maintain the hit ratio in Real cache. It can also improve write performance by reducing the search time for dirty pages, since Ghost cache consists of Dirty and Clean list. We find that the hit ratio and I/O performance of our policy are improved by 20.57% and 20.59% in average, respectively, when comparing them with the existing policies. The number of write operations is also reduced by 30.75% in average, compared with of the existing policies.

Embedding Algorithm among Folded Hypercube, Even Network and Odd Network (폴디드 하이퍼큐브와 이븐연결망, 오드연결망 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Sim, Hyun;Lee, Hyeong-Ok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.7
    • /
    • pp.318-326
    • /
    • 2008
  • In this paper, we will analyze embedding among Folded Hypercube, Even Network and Odd Network to further improve the network cost of Hypercube. We will show Folded Hypercube $FQ_n$ can be embedded into Even Network $E_{n-1}$ with dilation 2, congestion 1 and Even Network $E_d$ can be embedded into Folded Hypercube $FQ_{2d-3}$ with dilation 1. Also, we will prove Folded Hypercube $FQ_n$ can be embedded into Odd Network $O_{n-1}$ with dilation 2, congestion 1 and Odd Network $O_d$ can be embedded into Folded Hypercube $FQ_{2d-3}$ with dilation 2, congestion 1. Finally, we will show Even Network $E_d$ can be embedded into Odd Network $O_d$ with dilation 2, congestion 1 and Odd Network $O_d$ can be embedded into Folded Hypercube $E_{d-1}$ with dilation 2, congestion 1.

Bus Splitting Techniques for MPSoC to Reduce Bus Energy (MPSoC 플랫폼의 버스 에너지 절감을 위한 버스 분할 기법)

  • Chung Chun-Mok;Kim Jin-Hyo;Kim Ji-Hong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.9
    • /
    • pp.699-708
    • /
    • 2006
  • Bus splitting technique reduces bus energy by placing modules with frequent communications closely and using necessary bus segments in communications. But, previous bus splitting techniques can not be used in MPSoC platform, because it uses cache coherency protocol and all processors should be able to see the bus transactions. In this paper, we propose a bus splitting technique for MPSoC platform to reduce bus energy. The proposed technique divides a bus into several bus segments, some for private memory and others for shared memory. So, it minimizes the bus energy consumed in private memory accesses without producing cache coherency problem. We also propose a task allocation technique considering cache coherency protocol. It allocates tasks into processors according to the numbers of bus transactions and cache coherence protocol, and reduces the bus energy consumption during shared memory references. The experimental results from simulations say the bus splitting technique reduces maximal 83% of the bus energy consumption by private memory accesses. Also they show the task allocation technique reduces maximal 30% of bus energy consumed in shared memory references. We can expect the bus splitting technique and the task allocation technique can be used in multiprocessor platforms to reduce bus energy without interference with cache coherency protocol.

A Study on Reliability Based Design Criteria for Reinforced Concrete Columns (철근(鐵筋)콘크리트기둥의 신뢰성(信賴性) 설계규준(設計規準)에 관한 연구(研究))

  • Cho, Hyo Nam;Min, Kyung Ju
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.3 no.1
    • /
    • pp.25-33
    • /
    • 1983
  • This study is directed to propose a set of reliability based design provisions which gives more rational design for R.C. columns than the current WSD or USD standard design codes. Cornell's MFOSM theory is used for the derivation of the algorithm for the evaluation of uncertainties associated with resistances, whereas the magnitude of the uncertainties associated with load effects are chosen primarily by considering our level of practice. And thus the uncertainties so obtained are applied for the reliability analysis and the derivation of reliability based design criteria. A target reliability(${\beta}_0=4.0$) is selected as an appropriate value by comparing the values used in foreign countries and by analyzing the reliability levels of our current USD and WSD design standars. Then, a set of load and resistance factors corresponding to the target reliability is proposed as a reliability based design provision, and furthermoere a set of allowable stresses for reinforcing steel and concrete having same level of relibity with the corresponding LRFD criteria is also propared for the current WSD design provision. It may be concluded that the proposed LRFD reliability based design provisions and the corresponding allowable stresses give more rational design than the current code for R.C. columns and may be desirable to introdue into the current WSD and USD provision of R.C. column design.

  • PDF

Stop-start wave condition에서 연속류 모델의 개발 -단속연속류 모델에 유한한 가속도를 도입하는 방법-

  • 박지영;박창호
    • Proceedings of the KOR-KST Conference
    • /
    • 1998.10b
    • /
    • pp.295-295
    • /
    • 1998
  • 고속도로에서 교통류의 특성에 파악하여 교통류의 특성을 파악하여 동적행태로 교통상황을 분석하고 효과적인 제어전략, 시뮬레이션, 그리고 기하구조 개선등의 효율적이고 실용적인 적용을 위해서는 교통류의 정확한 모사가 필요하다. 시공간으로 표현되는 상태방정식을 포함하는 거시적 시뮬레이션 모델에 사용되는 연속류 모델은 이러한 교통류 특성을 모사하는데 적절하다. Lighthill과 Whitham(1955), Richard(1956)에 의해 일계도함수의 형태를 가지는 단순모델이 제시된 이후 모델의 결점을 보완하기 위해 많은 고계도 모델이 제시되었지만 고계도 모델이 가진 이론적인 결점에 대해서는 여러 연구들이 제시되어 있다. 또한 고계도 모델은 운동량 방정식의 유도, 정산, 구현의 어려움으로 널리 사용되기 힘들다는 단점을 가지고 있다. 만일 적절히 구현할 수 있다면 적용이 간단한 단순모델로도 보다 정확한 교통류 상황 모사가 가능하다. Ansorge는 혼잡교통류상황을 보다 정확하게 모사하기 위해 단순모델에 엔트로피 조건을 결합시킨 모델을 제시했다. Bui는 이 제안된 모델이 적절한 시뮬레이션 결과를 나타낸다는 것을 밝혔다. 그러나 이 모델은 차량의 재가속이 이루어지는 교통상황-stop-start wave의 경우 비현실적인 값을 가진다. 엔트로피조건에 의해 구해진 해는 실제보다 과다한 교통량을 추정하게 되는데 이런 결과는 위와 같은 교통상황에서 중요한 요소로 작용하는 가속효과가 무시되고 있기 때문이다. 따라서 본 연구에서는 stop-start wave 조건에서 가속도에 경계치를 부여하여 교통류율을 상한경계조건을 제시함으로써 교통상황에 맞는 교통류율을 산정하는 방법에 대해 제안하고자 한다.환승이라는 특정대안변수(Specific alternative variable)를 첨가하여 그것이 수단선택에 미치는 영향을 분석한다. 또한, 대중교통의 속성을 가지고 있는 지하철과 버스를 하나의 대안으로 묶어서 효용함수를 구한 다음 다시 승용차, 택시, 대중교통을 독립된 대안으로 두고 모형을 정립하는 NESTED LOGIT모형으로 파라메타를 추정하여 대중교통의 효용에 관해 분석·비교하였다. 본 논문에 이용된 자료는 공항을 이용하는 이용객들을 대상으로 직접 설문·면접조사한 자료이며 대상 교통수단은 승용차, 택시, 지하철, 버스로 설정하였다. 결과 적응형 알고리즘이 개개인의 최단시간 경로를 제공하는 사용자 평형 경로안내전략에 비해 교통혼잡도와 정체시간의 체류정도에 따라 3%에서 10%까지 전체통행시간을 절약할 수 있다는 결론을 얻었다.출발참, 구성대외개방선면축심, 실현국제항선적함접화국내항반적전항, 형성다축심복사식항선망; 가강기장건설, 개피포동제이국제기장건설, 괄응포동개발경제발전적수요. 부화개시일은 각 5월 26일과 5월 22일이었다. 11. 6월 중순에 애벌레를 대상으로 처리한 Phenthoate EC가 96.38%의 방제가로 약효가 가장 우수하였고 3월중순 및 4월중순 월동후 암컷을 대상으로 처리한 Machine oil, Phenthoate EC 및 Trichlorfon WP는 비교적 약효가 낮았다.>$^{\circ}$E/$\leq$30$^{\circ}$NW 단열군이 연구지역 내에서 지하수 유동성이 가장 높은 단열군으로 추정된다. 이러한 사실은 3개 시추공을 대상으로 실시한 시추공 내 물리검층과 정압주입시험에서도 확인된다.. It was result

  • PDF

A Single Allocation Hub Network Design Model for Intermodal Freight Transportation (단일할당 복합운송 허브 네트워크 설계 모형 개발)

  • Kim, Dong-Gyu;Gang, Seong-Cheol;Park, Chang-Ho;Go, Seung-Yeong
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.1
    • /
    • pp.129-141
    • /
    • 2009
  • Intermodal freight transportation is defined as the movement of freight from origins to destinations by two or more transportation modes. When implemented in hub networks, it could enhance the efficiency of the networks because consolidated flows are transported by more suitable modes and technologies. In spite of this advantage, the intermodal hub network design problem has received limited attention in the literature partly because of the complex nature of the problem. This paper aims to develop an optimization model for designing intermodal hub networks with sin91e allocation strategy. The model takes into account various cost components of intermodal hub networks including transportation, stationary inventory, and service delay costs. Moreover, using transport frequency variables, it is capable of endogenously determining the transportation economies of scale achieved by consolidation of flows. As such, the model is able to realistically represent the characteristics of intermodal hub networks in practice. Since the model Is a complicated nonlinear integer programming problem, we perform model simplification based on the analytical study of the model, which could facilitate the development of solution algorithms in the future. We expect that this study contributes to the design of intermodal hub networks as well as to the assessment of existing logistics systems.

A Study on the Simulation of Runoff Hydograph by Using Artificial Neural Network (신경회로망을 이용한 유출수문곡선 모의에 관한 연구)

  • An, Gyeong-Su;Kim, Ju-Hwan
    • Journal of Korea Water Resources Association
    • /
    • v.31 no.1
    • /
    • pp.13-25
    • /
    • 1998
  • It is necessary to develop methodologies for the application of artificial neural network into hydrologic rainfall-runoff process, although there is so much applicability by using the functions of associative memory based on recognition for the relationships between causes and effects and the excellent fitting capacity for the nonlinear phenomenon. In this study, some problems are presented in the application procedures of artificial neural networks and the simulation of runoff hydrograph experiences are reviewed with nonlinear functional approximator by artificial neural network for rainfall-runoff relationships in a watershed. which is regarded as hydrdologic black box model. The neural network models are constructed by organizing input and output patterns with the deserved rainfall and runoff data in Pyoungchang river basin under the assumption that the rainfall data is the input pattern and runoff hydrograph is the output patterns. Analyzed with the results. it is possible to simulate the runoff hydrograph with processing element of artificial neural network with any hydrologic concepts and the weight among processing elements are well-adapted as model parameters with the assumed model structure during learning process. Based upon these results. it is expected that neural network theory can be utilized as an efficient approach to simulate runoff hydrograph and identify the relationship between rainfall and runoff as hydrosystems which is necessary to develop and manage water resources.

  • PDF

Real-Time Flood Forecasting Using Rainfall-Runoff Model(I) : Theory and Modeling (강우-유출모형을 이용한 실시간 홍수예측(I) : 이론과 모형화)

  • 정동국;이길성
    • Water for future
    • /
    • v.27 no.1
    • /
    • pp.89-99
    • /
    • 1994
  • Flood forecasting in Korea has been based on the off-line parameter estimation method. But recent flood forecasting studies explore on-line recursive parameter estimation algorithms. In this study, a simultaneous adaptive estimation of system states and parameters for rainfall-runoff model is investigated for on-line real-time flood forecasting and parameter estimation. The proposed flood routing system is composed of Flood forecasting in Korea has been based on the off-line parameter estimation method. But recent flood forecasting studies explore on-line recursive parameter estimation algorithms. In this study, a simultaneous adaptive estimation of system states and parameters for rainfall-runoff model is investigated for on-line real-time flood forecasting and parameter estimation. The proposed flood routing system is composed of ø-index in the assessment of effective rainfall and the cascade of nonlinear reservoirs accounting for translation effect in flood routing. To combine the flood routing model with a parameter estimation model, system states and parameters are treated with the extended state-space formulation. Generalized least squares and maximum a posterior estimation algorithms are comparatively examined as estimation techniques for the state-space model. The sensitivity analysis is to investigate the identifiability of the parameters. The index of sensitivity used in this study is the covariance matrix of the estimated parameters.-index in the assessment of effective rainfall and the cascade of nonlinear reservoirs accounting for translation effect in flood routing. To combine the flood routing model with a parameter estimation model, system states and parameters are treated with the extended state-space formulation. Generalized least squares and maximum a posterior estimation algorithms are comparatively examined as estimation techniques for the state-space model. The sensitivity analysis is to investigate the identifiability of the parameters. The index of sensitivity used in this study is the covariance matrix of the estimated parameters.

  • PDF

Synchronization of Network Interfaces in System Area Networks (시스템 에어리어 네트?에서의 동기화 기법)

  • Song, Hyo-Jung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.5
    • /
    • pp.219-231
    • /
    • 2005
  • Many applications in cluster computing require QoS (Quality of Service) services. Since performance predictability is essential to provide QoS service, underlying systems must provide predictable performance guarantees. One way to ensure such guarantees from network subsystems is to generate global schedules from applications'network requests and to execute the local portion of the schedules at each network interface. To ensure accurate execution of the schedules, it is essential that a global time base must be maintained by local clocks at each network interface. The task of providing a single time base is called a synchronization problem and this paper addresses the problem for system area networks. To solve the synchronization problem, FM-QoS (1) proposed a simple synchronization mechanism called FBS(Feedback-Based Synchronization) which uses built-in How control signals. This paper extends the basic notion of FM-QoS to a theoretical framework and generalizes it: 1) to identify a set of built-in network flow control signals for synchrony and to formalize it as a synchronizing schedule, and 2) to analyze the synchronization precision of FBS in terms of flow control parameters. Based on generalization, two application classes are studied for a single switch network and a multiple switch network. For each class, a synchroniring schedule is proposed and its bounded skew is analyzed. Unlike FM-QoS, the synchronizing schedule is proven to minimize the bounded skew value for a single switch network. To understand the analysis results in practical networks, skew values are obtained with flow control parameters of Myrinet-1280/SAN. We observed that the maximum bounded skew of FBS is 9.2 Usec or less over all our experiments. Based on this result, we came to a conclusion that FBS was a feasible synchronization mechanism in system area networks.