• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.75-83
• /
• 2007

Multithreaded model is an effective parallel system in that it can reduce the long memory reference latency time and solve the synchronization problems. When compiling the non-strict functional programs for the multithreaded parallel machine, the most important thing is to find an set of sequentially executable instructions and to partitions them into threads. The existing partitioning algorithm partitions the condition of conditional expression, true expression and false expression into the basic blocks and apply local partitioning to these basic blocks. We can do the better partitioning if we modify the definition of the thread and allow the branching within the thread. The branching within the thread do not reduce the parallelism, do not increase the number of synchronization and do not violate the basic rule of the thread partitioning. On the contrary, it can lengthen the thread and reduce the number of synchronization. In the paper, we enhance the method of the partition of threads by combining the three basic blocks into one of two blocks.

• KOREAN JOURNAL OF PACKAGING SCIENCE & TECHNOLOGY
• /
• v.9 no.1
• /
• pp.1-6
• /
• 2003

The partitioning behavior of five printing ink solvents was studied in various cookie ingredients before and after baking which had different water content and different structure. Solvents were ethyl acetate, hexane, isopropanol, methyl ethyl ketone, and toluene which represent different characteristic functional groups. Gas chromatography (G.C.) was used to measure partitioning values at $25^{\circ}C$ on each raw and baked cookie ingredients. Baking condition of cookie ingredients was $260^{\circ}C$ for 10 min. In cookie ingredients, decreases in water content generally affected Kp of polar solvents, but did not affect that of the non-polar solvents. However, as water content decreased in the cookie ingredient, the Kp of the non-polar and polar solvents showed mixed results.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.73-76
• /
• 2001

High-level synthesis generates a structural design that implements the given behavior and satisfies design constraints for area, performance, power consumption, packaging, testing and other criteria. Thus, high-level synthesis generates that register-transfer(RT) level structure from algorithm level description. High-level synthesis consist of compiling, partitioning, scheduling. In this paper, we proposed the efficient scheduling algorithm that find the number of the functional unit and scheduling into the minimum control step with silicon area resource constrained.

• Preventive Nutrition and Food Science
• /
• v.16 no.3
• /
• pp.267-271
• /
• 2011

Static Headspace Gas Chromatographic analysis was used to study the partitioning behavior of five organic printing ink solvents between chocolate cookie/air systems. Three cookie sample formulations varied with respect to chocolate type and overall percentage of constituents. Major considerations involved differences in fat content and type and resulting variability in chemical and physical structure. Each of the solvents studied (ethyl acetate, hexane, isopropanol, methyl ethyl ketone, toluene) represents a general class of printing ink solvents based on predominate functional group. Values of the partitioning coefficient (Kp) were determined at equilibrium using measured quantities of both solvent and cookie sample in closed systems at temperature of 25, 35, and $45^{\circ}C$. In each of the three cookies at the three test temperatures, toluene always exhibited the greatest value of partitioning to cookie and hexane always exhibited the least. Results also showed that the partitioning behavior of solvents is generally inversely related to temperature and that solvent affinity, though constant for a particular cookie type over all test temperatures, varies significantly among the three cookie types. The preference of each of the five solvents for each cookie sample was also found to vary with temperature. No correlation was found between the extent of partitioning and cookie formulation or physical characteristic of solvent. The Hildebrand parameter, related to ${\Delta}Hmix$ (heat of mixing), may be used to describe differences in partitioning based on the overall potential of a solvent/cookie interaction to occur. The potential for interaction is dependent upon the chemical structure of the cookie sample and thus the availability of 'active-sites' required for a given solvent.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.572-574
• /
• 1998

In this paper, we are proposed design of ATM networks to transfer for electric power system informations, proposed transport networks is partitioned management part and functional part, management part is partitioned edge network, core network, local network, authority network, functional part is partitioned core network, access network, edge area. It is based on laying and partitioning by ITU-T G.805, we also proposed ATM network requirements for Carrier Relay traffic acceptability in electric power system information.

• Journal of Biomedical Engineering Research
• /
• v.30 no.4
• /
• pp.311-317
• /
• 2009

An automatic control system is proposed and implemented for a miniaturized DNA extraction system using magnetic bead. A host-local system is employed for the accommodation of the graphical user interface and the basic control function. The functional partitioning into the local and the host system is discussed. The control functions are classified and formalized for the flexible control scenario, which is the input of the proposed system. As the proposed scenario is consists of the sequence of the user-centric actions, the user goal can be easily programmed and modified. The DNA extraction performance of the implemented system was compared with the existing silica-membrane-based method, resulting in the comparable concentration and purity of the extracted DNA. The proposed system is currently being utilized for the development of the DNA extraction system only changing scenario, without any alteration of the system.

• Environmental Engineering Research
• /
• v.25 no.3
• /
• pp.281-289
• /
• 2020

Environmental fate of ionizable organic pollutants such as perfluoroalkyl acids (PFAAs) are of increasing interest but has not been well understood because of uncertain values for parameters related with atmospheric interphase partitioning behavior. In the present study, not only the values for air-water partition coefficient (K_AW) and dissociation constant (pKa) of PFAAs were induced by adjusting to in situ measurements of air-water distribution coefficient between vapor phase and rainwater but also gas-particle partition coefficients were also estimated using three-phase partitioning model of ionizable organic pollutants, in situ measurements of PFAAs in aerosol and air vapor phase, and obtained parameter values. The pKa values of PFAAs we obtained were close to the minimum values suggested in literature except for perfluorooctane sulfonic acids, and COSMOtherm-modeled K_AW values were assessed to more appropriate among suggested values. When applying parameter values we obtained, it was predicted that air particle-associated fate and transport of PFAAs could be negligible and PFAAs could distribute ubiquitously along the transection from urban to rural region by pH-dependent phase transfer in air. Our study is expected to have some implications in prediction of the environmental redistribution of other ionizable organic compounds.

• Genomics & Informatics
• /
• v.1 no.1
• /
• pp.20-24
• /
• 2003

The analysis of DNA microarry data is one of the most important things for functional genomics research. The matrix representation of microarray data and its successive 'optimal' incisional hyperplanes is a useful platform for developing optimization algorithms to determine the optimal partitioning of pairwise proximity matrix representing completely connected and weighted graph. We developed Deterministic Annealing (DA) approach to determine the successive optimal binary partitioning. DA algorithm demonstrated good performance with the ability to find the 'globally optimal' binary partitions. In addition, the objects that have not been clustered at small non­zero temperature, are considered to be very sensitive to even small randomness, and can be used to estimate the reliability of the clustering.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2127-2136
• /
• 1998

비평가인자 함수 언어는 비평가인자 어의로 인하여 기존의 von Neumann 형 병렬기에서 효율적인 수행을 어렵게 하는 미세수준의 동적 스케줄링 단위로 병합하는 과정이 중요하다. 이러한 과정을 스레드 분할이라 한다. 본 논문에서는 비평가인자 함수 프로그램을 스레드로 분할하는 자료형 분리집합 분할이라는 스레드 분할 알고리즘을 제안한다. 자료형 분리 집합 분할 알고리즘은 자료형을 비교할 수 없는 입력명과 출력명 사이에는 잠재 종속이 존재할 수 없다는 사실을 이용하여 스레드 분할을 수행한다. 이 방법을 사용하면 기존의 스레드 분할 방법에서 실패하는 스레드의 병합이 가능하며, 기존의 분할 알고리즘보다 더 큰 스레드를 생성할 수 있다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.8
• /
• pp.337-347
• /
• 2007

An embedded system is called a multi-mode embedded system if it performs multiple applications by dynamically reconfiguring the system functionality. Further, the embedded system is called a multi-mode multi-task embedded system if it additionally supports multiple tasks to be executed in a mode. In this Paper, we address a HW/SW partitioning problem, that is, HW/SW partitioning of multi-mode multi-task embedded applications with timing constraints of tasks. The objective of the optimization problem is to find a minimal total system cost of allocation/mapping of processing resources to functional modules in tasks together with a schedule that satisfies the timing constraints. The key success of solving the problem is closely related to the degree of the amount of utilization of the potential parallelism among the executions of modules. However, due to an inherently excessively large search space of the parallelism, and to make the task of schedulabilty analysis easy, the prior HW/SW partitioning methods have not been able to fully exploit the potential parallel execution of modules. To overcome the limitation, we propose a set of comprehensive HW/SW partitioning techniques which solve the three subproblems of the partitioning problem simultaneously: (1) allocation of processing resources, (2) mapping the processing resources to the modules in tasks, and (3) determining an execution schedule of modules. Specifically, based on a precise measurement on the parallel execution and schedulability of modules, we develop a stepwise refinement partitioning technique for single-mode multi-task applications. The proposed techniques is then extended to solve the HW/SW partitioning problem of multi-mode multi-task applications. From experiments with a set of real-life applications, it is shown that the proposed techniques are able to reduce the implementation cost by 19.0% and 17.0% for single- and multi-mode multi-task applications over that by the conventional method, respectively.