• Title/Summary/Keyword: dynamic memory theory

Search Result 40, Processing Time 0.029 seconds

Dynamic Buffer Allocation Scheme for Caching in Realtime Multimedia Systems (실시간 멀티미디어 시스템에서의 캐슁을 위한 동적 버퍼 할당 기법)

  • Kwon, Jin-Baek;Yeom, Heon-Young;Lee, Kyung-Oh
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.4
    • /
    • pp.420-430
    • /
    • 2000
  • Several caching schemes for realtime multimedia systems have been proposed, but they focus only on increasing the hit ratio without providing any means to utilize the saved disk bandwidth due to cache hits. One of the most important metrics in multimedia systems is the number of clients that the systems can service simultaneously guaranteeing Quality of Service(QoS). Preemptive but Safe Interval Caching(PSIC) was proposed as a caching scheme which makes it possible to provide deterministic QoS.. However, it has no ability to adapt to the change of system environments since it has no mechanism to change the cache size. In this paper, we present a new caching scheme, Dynamic Interval Caching(DIC), which maximizes the performance, regardless of the change of system environments, providing hiccup-free service, by managing memory buffers dynamically. And it is demonstrated that DIC allocates buffer cache optimally, by comparing with PSIC through trace-driven simulations.

  • PDF

Adaptive Dynamic Load Balancing Strategies for Network-based Cluster Systems (네트워크 기반 클러스터 시스템을 위한 적응형 동적 부하균등 방법)

  • Jeong, Hun-Jin;Jeong, Jin-Ha;Choe, Sang-Bang
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.11
    • /
    • pp.549-560
    • /
    • 2001
  • Cluster system provides attractive scalability in terms of compution power and memory size. With the advances in high speed computer network technology, cluster systems are becoming increasingly competitive compared to expensive MPPs (massively parallel processors). Load balancing is very important issue since an inappropriate scheduling of tasks cannot exploit the true potential of the system and can offset the gain from parallelization. In parallel processing program, it is difficult to predict the load of each task before running the program. Furthermore, tasks are interdependent each other in many ways. The dynamic load balancing algorithm, which evaluates each processor's load in runtime, partitions each task into the appropriate granularity and assigns them to processors in proportion to their performance in cluster systems. However, if the communication cost between processing nodes is expensive, it is not efficient for all nodes to attend load balancing process. In this paper, we restrict a processor that attend load balancing by the communication cost and the deviation of its load from the average. We simulate various models of the cluster system with parameters such as communication cost, node number, and range of workload value to compare existing load balancing methods with the proposed dynamic algorithms.

  • PDF

Pragmatic Reachability Analysis of Bounded Petri Nets based on Unfoldings (언폴딩에 기반한 유한페트리넷의 실용적 도달가능성 분석)

  • Kim, Eui-Seok;Lee, Jeong-Gun;Lee, Dong-Ik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.6
    • /
    • pp.599-607
    • /
    • 2000
  • This paper suggests an efficient reachability analysis method of bounded petri nets. Reachability analysis is a fundamental basis for studying the dynamic properties of any discrete event systems. However, it takes at least exponential execution time and memory space to verify in general petri nets. That is, state space explosion problem may occur. In this paper, we attack problems of previous approaches - state space explosion and restrictions to applicable petri net classes - by formulating the reachability problem as set operation over structural relations among places on an unfolding.

  • PDF

A Review on "Kidney" Functional System in Korean Medicine : From the Perspective of Molecular Physiology (한의학 신(腎) 기능계에 관한 분자생리학적 고찰)

  • Miso S., Park;Junghyo, Cho;Wangjung, Hur;Horyong, Yoo
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.36 no.5
    • /
    • pp.169-174
    • /
    • 2022
  • In Korean medicine, the "five viscera" theory develops into the theory of homeostasis, in which the dynamic equilibrium state of the yin yang and five elements in the body maintain the balance of the physiological functions. The "five viscera" of the "five elements" can also be referred to as the "functional system," a conceptual system that includes all functional interactions mediated by the organ as well as the organ itself. Nowadays, the structure and function of the organs and tissues in the body are being re-examined, and there is now enough evidence that organs, structures, and their functions that belong to the same "element" are all connected in terms of energy metabolism. The functional system of the "kidney" includes the kidney itself, as well as other components that belong to "water" of the five elements such as bladder, bone, ear, essence, memory, and fear. The authors will discuss the latest findings in science and medicine to expand the understanding of the "Kidney" functional system to the level of molecular physiology.

An Application-Specific and Adaptive Power Management Technique for Portable Systems (휴대장치를 위한 응용프로그램 특성에 따른 적응형 전력관리 기법)

  • Egger, Bernhard;Lee, Jae-Jin;Shin, Heon-Shik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.8
    • /
    • pp.367-376
    • /
    • 2007
  • In this paper, we introduce an application-specific and adaptive power management technique for portable systems that support dynamic voltage scaling (DVS). We exploit both the idle time of multitasking systems running soft real-time tasks as well as memory- or CPU-bound code regions. Detailed power and execution time profiles guide an adaptive power manager (APM) that is linked to the operating system. A post-pass optimizer marks candidate regions for DVS by inserting calls to the APM. At runtime, the APM monitors the CPU's performance counters to dynamically determine the affinity of the each marked region. for each region, the APM computes the optimal voltage and frequency setting in terms of energy consumption and switches the CPU to that setting during the execution of the region. Idle time is exploited by monitoring system idle time and switching to the energy-wise most economical setting without prolonging execution. We show that our method is most effective for periodic workloads such as video or audio decoding. We have implemented our method in a multitasking operating system (Microsoft Windows CE) running on an Intel XScale-processor. We achieved up to 9% of total system power savings over the standard power management policy that puts the CPU in a low Power mode during idle periods.

Speed Enhancement Technique for Ray Casting using 2D Resampling (2차원 리샘플링에 기반한 광선추적법의 속도 향상 기법)

  • Lee, Rae-Kyoung;Ihm, In-Sung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.8
    • /
    • pp.691-700
    • /
    • 2000
  • The standard volume ray-tracing, optimized with octree, needs to repeatedly traverse hierarchical structures for each ray that often leads to redundant computations. It also employs the expensive 3D interpolation for producing high quality images. In this paper, we present a new ray-casting method that efficiently computes shaded colors and opacities at resampling points by traversing octree only once. This method traverses volume data in object-order, finds resampling points on slices incrementally, and performs resampling based on 2D interpolation. While the early ray-termination, which is one of the most effective optimization techniques, is not easily combined with object-order methods, we solved this problem using a dynamic data structure in image space. Considering that our new method is easy to implement, and need little additional memory, it will be used as very effective volume method that fills the performance gap between ray-casting and shear-warping.

  • PDF

A Time Domain Analysis for Hydroelastic Behavior of a Mat-type Large Floating Structure in Calm Water under Dynamic Loadings by Mode Superposition Method (모드중첩법을 이용한 정수중의 매트형 거대부유구조물의 동하중에 대한 시간영역 유탄성 해석)

  • D.H. Lee;K.N. Jo;Y.R. Choi;S.Y. Hong;H.S. Choi
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.38 no.4
    • /
    • pp.39-47
    • /
    • 2001
  • In this paper, the hydroelastic behavior of a mat-type large floating structure is analyzed in time domain by using mode superposition method. The time-memory function is estimated by Fourier transforming the wave damping coefficients, which are computed by a higher-order boundary element method based on potential theory. Meanwhile, the structural response is obtained by time integrating the eigenmodes of the structure. Numerical examples are made for three test cases on the scaled model of a mat-type large floating structure ; weight pull-up case, weight drop case and weight moving case. In all three cases, the numerical results coincide well with experimental data.

  • PDF

Realtime Attention System of Autonomous Virtual Character using Image Feature Map (시각적 특징 맵을 이용한 자율 가상 캐릭터의 실시간 주목 시스템)

  • Cha, Myaung-Hee;Kim, Ky-Hyub;Cho, Kyung-Eun;Um, Ky-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.5
    • /
    • pp.745-756
    • /
    • 2009
  • An autonomous virtual character can conduct itself like a human after recognizing and interpreting the virtual environment. Artificial vision is mainly used in the recognition of the environment for a virtual character. The present artificial vision that has been developed takes all the information at once from everything that comes into view. However, this can reduce the efficiency and reality of the system by saving too much information at once, and it also causes problems because the speed slows down in the dynamic environment of the game. Therefore, to construct a vision system similar to that of humans, a visual observation system which saves only the required information is needed. For that reason, this research focuses on the descriptive artificial intelligence engine which detects the most important information visually recognized by the character in the virtual world and saves it into the memory by degrees. In addition, a visual system is constructed in accordance with an image transaction theory to make it sense and recognize human feelings. This system finds the attention area of moving objects quickly and effectively through the experiment of the virtual environment with three dynamic dimensions. Also the experiment enhanced processing speed more than 1.6 times.

  • PDF

Design and Implementation of An I/O System for Irregular Application under Parallel System Environments (병렬 시스템 환경하에서 비정형 응용 프로그램을 위한 입출력 시스템의 설계 및 구현)

  • No, Jae-Chun;Park, Seong-Sun;;Gwon, O-Yeong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.11
    • /
    • pp.1318-1332
    • /
    • 1999
  • 본 논문에서는 입출력 응용을 위해 collective I/O 기법을 기반으로 한 실행시간 시스템의 설계, 구현 그리고 그 성능평가를 기술한다. 여기서는 모든 프로세서가 동시에 I/O 요구에 따라 스케쥴링하며 I/O를 수행하는 collective I/O 방안과 프로세서들이 여러 그룹으로 묶이어, 다음 그룹이 데이터를 재배열하는 통신을 수행하는 동안 오직 한 그룹만이 동시에 I/O를 수행하는 pipelined collective I/O 등의 두 가지 설계방안을 살펴본다. Pipelined collective I/O의 전체 과정은 I/O 노드 충돌을 동적으로 줄이기 위해 파이프라인된다. 이상의 설계 부분에서는 동적으로 충돌 관리를 위한 지원을 제공한다. 본 논문에서는 다른 노드의 메모리 영역에 이미 존재하는 데이터를 재 사용하여 I/O 비용을 줄이기 위해 collective I/O 방안에서의 소프트웨어 캐슁 방안과 두 가지 모형에서의 chunking과 온라인 압축방안을 기술한다. 그리고 이상에서 기술한 방안들이 입출력을 위해 높은 성능을 보임을 기술하는데, 이 성능결과는 Intel Paragon과 ASCI/Red teraflops 기계 상에서 실험한 것이다. 그 결과 응용 레벨에서의 bandwidth는 peak point가 55%까지 측정되었다.Abstract In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O simultaneously, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined to reduce I/O node contention dynamically. In other words, the design provides support for dynamic contention management. Then we present a software caching method using collective I/O to reduce I/O cost by reusing data already present in the memory of other nodes. Finally, chunking and on-line compression mechanisms are included in both models. We demonstrate that we can obtain significantly high-performance for I/O above what has been possible so far. The performance results are presented on an Intel Paragon and on the ASCI/Red teraflops machine. Application level I/O bandwidth up to 55% of the peak is observed.he peak is observed.

A Study on the Cubism - In it's relation to Bergsonian Philosophy and Simultaneity - (큐비즘에 관한 연구 - 베르그송 철학과 동시성 개념을 중심으로 -)

  • Ryu, Ji-Seok;Oh, Chan-Ohk
    • Archives of design research
    • /
    • v.18 no.3 s.61
    • /
    • pp.117-128
    • /
    • 2005
  • The French Belle Epoque is a period where the literary and artistic movement was very activated. The birth of the cubism reflects this atmosphere of the times and the change of paradigm in all fields. The Bergsonism is often designated as one of the important backgrounds of cubism. The problem consists in knowing if Bergsonian ideas gave real influence on the cubist movement and up to what point. Our analysis will show that it is not homogenous and very variable according to painters. In the case of Picasso and Braques it seems be a simple inspiration of Zeitgeist. But the influence upon Metzinger and Gleizes is explicit. The text of 1912, Du cubism, prove their attachment to his thought. The key concept of cubist theory, influenced by Bergsonian philosophy, is the concept of simultaneity. Cubist simultaneity is in one hand a reflection of an artist's psychological experience and the other hand a synthesis of multiple views for grasping the object in itself by the way of conceptual representation. The temporal simultaneity could be identified with the notion of memory, which is a temporal continuity connecting the past to dynamic present. The spatial simultaneity is a juxtaposition of multiple views obtained by the movement around the object. But the dose reading of Bergson's text shows that there is a divergence between the notion of cubist simultaneity and his ideas. The biased interpretation is often, as well as the strict understanding, like the history shows us well, a great source of inspiration and creativity. The cubist mouvement is not far from this case.

  • PDF