• Title, Summary, Keyword: tree allocation

Search Result 84, Processing Time 0.034 seconds

A k-Tree-Based Resource (CU/PE) Allocation for Reconfigurable MSIMD/MIMD Multi-Dimensional Mesh-Connected Architectures

  • Srisawat, Jeeraporn;Surakampontorn, Wanlop;Atexandridis, Kikitas A.
    • Proceedings of the IEEK Conference
    • /
    • /
    • pp.58-61
    • /
    • 2002
  • In this paper, we present a new generalized k-Tree-based (CU/PE) allocation model to perform dynamic resource (CU/PE) allocation/deallocation decision for the reconfigurable MSIMD/MIMD multi-dimensional (k-D) mesh-connected architectures. Those reconfigurable multi-SIMD/MIMD systems allow dynamic modes of executing tasks, which are SIMD and MIMD. The MIMD task requires only the free sub-system; however the SIMD task needs not only the free sub-system but also the corresponding free CU. In our new k-Tree-based (CU/PE) allocation model, we introduce two best-fit heuristics for the CU allocation decision: 1) the CU depth first search (CU-DFS) in O(kN$_{f}$ ) time and 2) the CU adjacent search (CU-AS) in O(k2$^{k}$ ) time. By the simulation study, the system performance of these two CU allocation strategies was also investigated. Our simulation results showed that the CU-AS and CU-DFS strategies performed the same system performance when applied for the reconfigurable MSIMD/MIMD 2-D and 3-D mesh-connected architectures.

  • PDF

Computer Simulation of Branching Pattern in Magnolia denudata Desr. (백목련의 분지형에 관한 Computer Simulation)

  • Park, Bong-Kyu
    • The Korean Journal of Ecology
    • /
    • v.6 no.4
    • /
    • pp.1-9
    • /
    • 1983
  • The observation of branching pattern on Magnolia denudata Desr. was performed from July 1982 to September 1983 and then computer simulation was carried out. Tree crown pattern depends on not genetic factors but also environmental factors and the determination of branchin pattern which characterized it appears to properly explain the relationships such as branching pattern and allocation of materials through the analysis of influence branches under several assumptions. Now that computer simulated simulated pattern was considered as the accumulation of two factors which controled the growth, it was represented as the stimulated tree which differs in branching rate that described allocation of material necessary for the growth of each branch. There was a tendency of allocation ratio of nutrients, i.e. subbranch to main branch to decrease by the passage of year. Under assumption that branch was branched when accumulated material reached 1, it was possible to represent the allocation of nutrients are residual $nutrient{\times}\frac{1}{1+F};in main; branch, ; residual; nutrient{\times}\frac{F}{1+F}$ in subbranch, A(iA, iC)+$F^(iA-1)$ in current twig. Like this, the basic minute difference of the allocation of nutrients according to the branch resulted in complicated patterns in the tree crown.

  • PDF

A Shortest Path Allocation Algorithm for the Load Balancing in Hypercubes (하이퍼큐브 상에서의 부하 분산을 우한 최단 경로 할당 알고리듬)

  • 이철원;임인칠
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.4
    • /
    • pp.27-36
    • /
    • 1993
  • This paper proposes a shortest path allocation algorithm over the processors on the hypercube system based on the message passing techniques with the optimized module allocation. On multiprocessor systems, how to divide one task into multiple tasks efficiently is an important issue due to the hardness of the life cycle estimation of each process. To solve the life cycle discrepancies, the appropriate task assignment to each processor and the flexible communications among the processors are indispensible. With the concurrent program execution on hypercube systems, each process communicaties to others with the method of message passing. And, each processor has its own memory. The proposed algorithm generates a callable tree out of the module, assigns the weight factors, constructs the allocation graph, finds the shortest path allocation tree, and maps them with hypercube.

  • PDF

Simulation-Based Risk Analysis of Integrated Power System (시뮬레이션을 이용한 통합전력시스템의 위험도 분석)

  • Lee, Ji Young;Han, Young Jin;Yun, Won Young;Bin, Jae Goo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.42 no.2
    • /
    • pp.151-164
    • /
    • 2016
  • In this paper, we deal with a risk analysis for an IPS (Integrated power system) and propose a simulation model combining the fault tree and event tree in order to estimate the system availability and risk level, together. Firstly, the basic information such as operational scenarios, physical structure, safety systems is explained in order to make the fault tree and event tree of the IPS. Next, we propose a discrete-event simulation model using a next-event time advance technique to advance the simulation time. Also the state transition and activity diagrams are explained to represent the relationship between the objects. By numerical examples, the redundancy allocation is considered in order to decrease the risk level of the IPS.

Efficient Multiple Joins using the Synchronization of Page Execution Time in Limited Processors Environments (한정된 프로세서 환경에서 체이지 실행시간 동기화를 이용한 효율적인 다중 결합)

  • Lee, Kyu-Ock;Weon, Young-Sun;Hong, Man-Pyo
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.732-741
    • /
    • 2001
  • In the relational database systems the join operation is one of the most time-consuming query operations. Many parallel join algorithms have been developed 개 reduce the execution time Multiple hash join algorithm using allocation tree is one of the most efficient ones. However, it may have some delay on the processing each node of allocation tree, which is occurred in tuple-probing phase by the difference between one page reading time of outer relation and the processing time of already read one. This delay problem was solved by using the concept of synchronization of page execution time with we had proposed In this paper the effects of the performance improvements in each node of the allocation tree are extended to the whole allocation tree and the performance evaluation about that is processed. In addition we propose an efficient algorithm for multiple hash joins in limited number of processor environments according to the relationship between the number of input relations in the allocation tree and the number of processors allocated to the tree. Finally. we analyze the performance by building the analytical cost model and verify the validity of it by various performance comparison with previous method.

  • PDF

Channel Allocation Strategies for Interference-Free Multicast in Multi-Channel Multi-Radio Wireless Mesh Networks

  • Yang, Wen-Lin;Hong, Wan-Ting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.2
    • /
    • pp.629-648
    • /
    • 2012
  • Given a video stream delivering system deployed on a multicast tree, which is embedded in a multi-channel multi-radio wireless mesh network, our problem is concerned about how to allocate interference-free channels to tree links and maximize the number of serviced mesh clients at the same time. In this paper, we propose a channel allocation heuristic algorithm based on best-first search and backtracking techniques. The experimental results show that our BFB based CA algorithm outperforms previous methods such as DFS and BFS based CA methods. This superiority is due to the backtracking technique used in BFB approach. It allows previous channel-allocated links to have feasibility to select the other eligible channels when no conflict-free channel can be found for the current link during the CA process. In addition to that, we also propose a tree refinement method to enhance the quality of channel-allocated trees by adding uncovered destinations at the cost of deletion of some covered destinations. Our aim of this refinement is to increase the number of serviced mesh clients. According to our simulation results, it is proved to be an effective method for improving multicast trees produced by BFB, BFS and DFS CA algorithms.

A Study on the File Allocation in Distributed Computer Systems (분산 컴퓨터 시스템에서 파일 할당에 관한 연구)

  • 홍진표;임재택
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.4
    • /
    • pp.571-579
    • /
    • 1990
  • A dynamic relocation algorithm for non-deterministic process graph in distributed computer systems is proposed. A method is represented for determining the optimal policy for processing a process tree. A general database query request is modelled by a process tree which represent a set of subprocesses together with their precedence relationship. The process allocation model is based on operating cost which is a function fo selection of site for processing operation, data reduction function and file size. By using expected values of parameters for non-deterministic process tree, the process graph and optimal policy that yield minimum operating cost are determined. As process is relocated according to threshold value and new information of parameters after the execution of low level process for non-deterministic process graph, the assigned state that approximate to optiaml solution is obtained. The proposed algorihtm is heuristic By performing algorithm for sample problems, it is shown that the proposed algorithm is good in obtaining optimal solution.

  • PDF

A Slot Scheduling Algorithm for Balancing Power Consumption in Tree-based Sensor Networks (트리 기반 센서네트워크에서 전력 소모 균형을 위한 슬랏 스케쥴링 알고리즘)

  • Kim, Je-Wook;Oh, Roon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.5A
    • /
    • pp.502-510
    • /
    • 2011
  • In this paper, we propose a slot scheduling algorithm for balancing power consumption in tree-based sensor networks. In this type of networks, nodes with lower depths tend to consume more energy than those with higher depths, thereby reducing the life time of the network. The proposed algorithm allocates a series of receiving slots first and then a series of sending slots. This way of slot allocation eases packet aggregation and filtering, and thus reduces traffic load on nodes near a sink. We compare the proposed algorithm and the frame-slot allocation algorithm employed in the TreeMAC by resorting to simulation. The simulation results showed that the proposed approach well achieves the balancing of power consumption.

Allometry, Biomass and Productivity of Quercus Forests in Korea: A Literature-based Review

  • Li, Xiaodong;Yi, Myong-Jong;Son, Yo-Whan;Jin, Guangze;Lee, Kyeong-Hak;Son, Yeong-Mo;Kim, Rae-Hyun
    • Journal of Korean Society of Forest Science
    • /
    • v.99 no.5
    • /
    • pp.726-735
    • /
    • 2010
  • Publications with the data on allometric equation, biomass and productivity of major oak forests in Korea were reviewed. Different allometric equations of major oak species showed site- or speciesspecific dependences. The biomass of major oak forests varied with age, dominant species, and location. Aboveground tree biomass over the different oak species was expressed as a power equation of the stand age. The proportion of tree component (stem, branch and leaf) to total aboveground biomass differed among oak species, however, biomass ranked stem > branch > leaf in general. The leaf biomass allocation over the different oak species was expressed as a power equation of total aboveground biomass while there were no significant patterns of biomass allocation from stem and branch to the aboveground biomass. Tree root biomass continuously increased with the aboveground biomass for the major oak forests. The relationship between the root to shoot ratio and the aboveground tree biomass was expressed by a logarithmic equation for major oak forests in Korea. Thirteen sets of data were used for estimating the net primary production (NPP) and net ecosystem production (NEP) of oak forests. The mean NPP and NEP across different oak forests was 10.2 and 1.9 Mg C $ha^{-1}year^{-1}$. The results in biomass allocation, NPP and NEP generally make Korean oak forests an important carbon sinks.

Tree Form and Biomass Allocation of Quercus species, Larix leptolepis (Sieb. et Zucc.) Gordon and Pinus koraiensis Sieb. et Zucc. in Kwangju-Gun, Kyunggi-Do (경기도(京畿道) 광주지방(廣州地方)에서 자라는 참나무류, 낙엽송(落葉松) 및 잣나무의 수형특성(樹形特性)과 물질분배(物質分配))

  • Lee, Don Koo;Kim, Gab Tae
    • Journal of Korean Society of Forest Science
    • /
    • v.86 no.2
    • /
    • pp.208-213
    • /
    • 1997
  • Tree form characteristics and biomass distribution and volume increment for Quercus spp., Larix leptolepis and Pinus koraiensis growing in Kwangju-Gun, Kyunggi-Do were investigated. P. koraiensis showed higher crown percentage than L. leptolepis, indicating that P. koraiensis maybe shade-tolerant species. Biomass allocation by tree height showed significant difference among three species. Stem biomass distributed more dimminishing along tree height with Quercus spp. and P. koraiensis than L. leptolepis. The allometric pattern of leaf-and branch biomass appeared as normal distribution. Present biomass was highest in L. leptolepis showing 171.1tons/ha and followed by P. koraiensis and Quercus spp, with 75.3tons/ha and 61.6tons/ha, respectively.

  • PDF