• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.329-332
• /
• 2000

This paper proposed resource allocation algorithm for the minimum power consumption of functional unit in high level synthesis process as like DSP which is circuit to give many functional unit. In this paper, the proposed method though high level simulation find switching activity in circuit each functional unit exchange for binary sequence length and value bit are logic one value. To used the switching activity find the allocation with minimal power consumption, the proposed method visits all control steps one by one and determines the allocation with minimal power consumption at each control step.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.121-124
• /
• 2001

This paper proposed resource allocation algorithm for the minimum switching activity of functional unit in high level synthesis process as like DSP which is circuit to give many functional unit. The resource allocation method after scheduling use the power function calculating average hamming distance and switching activity of the between two input. First of all, the switching activity is calculated by the input value after calculating the average hamming distance between operation. In this paper, the proposed method though high If level simulation find switching activity in circuit each functional unit exchange for binary sequence length and value bit are logic one value. To use the switching activity find the allocation with minimal power consumption, the proposed method visits all control steps one by one and determines the allocation with minimal power consumption at each control step. As the existing method, the execution time can be fast according to use the number of operator and max control step. And it is the reduction effect from 6% to 8%.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1255-1262
• /
• 2000

This paper proposes a hardware allocation and binding algorithm for ASIC Design. The proposed algorithm works on schedules input graph and simultaneously allocates and binds functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. Especially, he register allocation is executes the allocation optimal using graph coloring. This paper shows the effectiveness of the algorithm by comparing experiments to determine number of functional unit and register in advance or to separate executing allocation and binding of existing system.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.2 no.2
• /
• pp.52-60
• /
• 1999

By implementing the Systems Engineering process for the aircraft preliminary design, functional analysis study is performed, hence Functional Interface Data Flow(FIDF) and Functional Flow Block Diagram(FFBD) are generated. Based on FIDF and FFBD, allocable and non-allocable design/performance/RM＆S requirements are allocated to the appropriate levels. Weight and cost tracking and design margin management methodologies are studied and implemented for the balanced aircraft design.

• The Korean Journal of Ecology
• /
• v.18 no.2
• /
• pp.231-241
• /
• 1995

I examined the relationship between allocations to plant size components such as plant height, total leaf weight, and nuber of branches and to reproductive components such as the number and weight of male and female fowers in three populations of the monoecious, wind-pollinated Ambrosia artemisiifolia. In particular, the two types of gender of plants, phenotypic and functional gender, were related to resource allocation. Mean values of all plant size and reproductive components differed significantly among the three populations. Such inter-population differences did not exist for both photosynthetic and reproductive efforts, Plant size components were mostly positively correlated with reproductive components among plants. However, the relationships between photosynthetic effort and reproductive components were largely negative and inconsistent among populations. The phenotypic gender was much lover than 0.5 in all of the three populations. Pairwise correlations between functional gender and each allocation measurement such as plant size components, reproductive components, photosynthetic effort, and reproductive effort were not consistent across the three populations. These results suggest that the gender of A. artemisiifolia measured as flower production responds sensitively to environmental conditions which might differ whithin as well as among populations.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.6 no.3
• /
• pp.165-173
• /
• 2007

In this paper, we propose a new minimum resources allocation algorithm for optimal design automation. In the proposed algorithm, the operation are allocated to functional units so that the number of interconnection wires between functional units can be minimized. The registers are allocated to the maximal clusters generated by the minimal cluster partitioning algorithm. Finally, the interconnection is minimized by removing the duplicated inputs of multiplexers and exchanging the inputs across multiplexers. The efficiency of the proposed allocation algorithm is shown by experiments using benchmark examples.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.3
• /
• pp.85-93
• /
• 2010

This paper proposes a new dynamic hardware allocation and binding algorithm of a simultaneous allocation and binding for SOC design automation. The proposed algorithm works on scheduled input graph and simultaneously allocates binds functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. This paper shows the effectiveness of the proposed algorithm by comparing experiments to determine number of function unit in advance or by comparing separated executing allocation and binding of existing system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10A
• /
• pp.1604-1612
• /
• 2000

This paper proposes a simultaneous hardware resource allocation and binding algorithm for VLSI design. The proposed algorithm works on scheduled input graph and simultaneously allocates binds functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. Also, the register allocation is especially executes the allocation optima us-ing graph coloring techniques. Therefore the overall resource is reduced. This paper shows the effectiveness of the proposed algorithm by comparing experiments to determine number of functional unit in advance or to separate executing allocation and binding of existing system.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.8
• /
• pp.1303-1310
• /
• 1990

This paper describes the design and implementation of a system for automatic data path synthesis in digital system. There are four subtasks to synthesize a digital system: scheduling, register allocation, functional unit allocation and bus allocation. In this paper, force directed algorithm is used for the scheduling while new algorithms are proposed for the allocation subtasks. Synthesis results of two experimental data paths including MC6502 have shown that our proposed algorithm out goes most of previous works.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.7
• /
• pp.19-29
• /
• 2019

Requirements traceability is regarded as one of the important quality attributes in software requirements engineering field. If requirements traceability is guaranteed then we can trace the requirements' life throughout all the phases, from the customers' needs in the early stage of the project to requirements specification, deployment, and maintenance phase. This includes not only tracking the development artifacts that accompany the requirements, but also tracking backwards from the development artifacts to the initial customer requirements associated with them. In this paper, especially, we dealt with the traceability between functional requirements and non-functional requirements. Among many Information Retrieval (IR) techniques, we decided to utilize Latent Semantic Indexing (LSI) and Latent Dirichlet Allocation (LDA) in our research. Ultimately, we conducted an experiment on constructing traceability by using two techniques and analyzed the experiment results. And then we provided a comparative study between two IR techniques in constructing traceability between functional requirements and non-functional requirements.