• Journal of the military operations research society of Korea
• /
• v.17 no.2
• /
• pp.113-122
• /
• 1991

This paper presents the Allocation Priority Scheme (APS) for multiprocessor system. The objective of APS is to reduce the time-complexity on a Physical Mapping Scheme(PMS). The PMS is to allocate the nodes of the Data Dependency Graph (DDG) to the multprocessors efficiently and effectively. The APS provides the priority to each node (vertex) in the DDG. In other words, the goal of the APS is to find a request resource mapping such that the total cost (time-complexity) is minimized. The special case in which all requests have equal priorities and all resoruces have equal precedences, and the comparisons between our APS and other schems are discussed in the paper. The APS provides the heuristic rules which are based on maximum height (MH), number of children nodes ($N_c$), number of father nodes ($N_f$), and computation time ($T_c$). The estimation moth of the computaion time is in the paper.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.3
• /
• pp.11-23
• /
• 1995

In this paper, a parallel pipelined processor model which acts as a small VLIW processor architecture and a scheduling algorithm for extracting instruction-level parallelism on this architecture are proposed. The proposed model has a dual-instruction mode which has maximum 4 basic operations being executed in parallel. By combining these basic operations, variable instruction set can be designed for various applications. The scheduling algorithm schedules basic operations for parallel execution and removes pipeline hazards by examining data dependency and resource conflict relations. In order to examine operation and evaluate the performance,a C compiler and a simulator are developed. By simulating various test programs with the compiler and the simulator, the characteristics and the performance result of the proposed architecture are measured.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.340-344
• /
• 2005

For the next generation wireless systems, multimedia services will be highly demanded and needed to transmit the cost-efficient packet data. With this regard, the adaptive resource management methods are preferable to optimally control the various traffic classes in OFDMA (WiBro) systems. We have developed a sub-channel state prediction method based on the past sub-channel state dependency. Using the method, we are developed a scheduling algorithm that can efficiently control multimedia traffic downlink transmissions.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1646-1655
• /
• 1999

This thesis presents a new VHDL intermediate format CDDG(Control Dominated Data Graph) and a minimal constrained scheduling algorithm for an optimal control dominated ASIC design. CDDG is a control flow graph which represents conditional branches and loops efficiently. Also it represents data dependency and such constraints as hardware resource and timing. In the proposed scheduling algorithm, the constraints using the inclusion and overlap relation among subgraphs. The effectiveness of the proposed algorithm has been proven by the experiment with the benchmark examples.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.7
• /
• pp.104-114
• /
• 1995

In this paper, an intermediate representation HSFG(Hanyang Sequential Flow GRaph) and a new scheduling algorithm for the control-dominated ASIC design is presented. The HSFG represents control flow, data dependency and such constraints as resource constraints and timing constraints. The scheduling algorithm minimizes the total operating time by reducing the number of the constraints as maximal as possible, searching a few paths among all the paths produced by conditional branches. The constraints are substitute by subgraphs, and then the number of subgraphs (that is the number kof the constraints) is minimized by using the inclusion and overlap relation among subgraphs. The proposed algorithm has achieved the better results than the previous ones on the benchmark data.

• Journal of information and communication convergence engineering
• /
• v.17 no.2
• /
• pp.149-160
• /
• 2019

Web applications typically interact with databases. Therefore, it is very crucial to understand which web components access which database resources when maintaining web apps. Existing research identifies interactions between Java web components, such as JavaServer Pages and servlets but does not extract dependencies between the web components and database resources, such as tables and attributes. This paper proposes a dynamic analysis of Java web apps, which extracts such dependencies from a Java web app and represents them as a graph. The key responsibility of our analysis method is to identify when web components access database resources. To fulfill this responsibility, our method dynamically observes the database-related objects provided in the Java standard library using the proxy pattern, which can be applied to control access to a desired object. This study also experiments with open source web apps to verify the feasibility of the proposed method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.5
• /
• pp.681-691
• /
• 1986

To represent the relations of the data dependency and resource conflict among micro-operations(MOP's) in the compaction process of microprograms, we propose a DDM (data dependent matrix) representation method instead of the DAG (conventional directed acyclic graph). Also, we propose a global compaction algorithm of microprograms to prevent a kind of block copying by cutting the trace at a junction block. The DDM method and compaction algoristhm have been applied to the Lah's example. The results shows that the proposed algorithm is more efficient than the conventional algorithms in reducing in reducing the total execution time and control memory space.

• Journal of Family Resource Management and Policy Review
• /
• v.27 no.2
• /
• pp.49-62
• /
• 2023

Grit is a person's passion and perseverance that drive them to achieve long-term and meaningful goals. The purpose of this study was to identify practical resources that can affect single parents' grit. Using the fourth-year panel data from the Korean Children and Youth Panel Survey 2018 (KCYPS 2018), descriptive statistics were produced and a correlation analysis was conducted for 284 single parents. Hierarchical regression analysis was also performed to explore the demographic factors, personal resources(psychological, lifestyle/health), and family resources(family relationships/child, economic) that affect single parents' grit. First, the correlation analysis revealed that single parents' grit had a significant correlation with age, education status, life satisfaction, happiness, self-esteem, smartphone dependency, physical activity time, frequency of breakfast consumption, household size, parent's satisfaction with child's school achievement and school adjustment, subjective family economic status, and private education expenses. Second, the hierarchical regression analysis revealed that education status, self-esteem, employment status, smartphone dependency, physical activity time, household size, parent's satisfaction with child's school achievement, and subjective family economic status were significant factors affecting single parents' grit. Based on the research results, this study suggests directions for programs and policies to provide a stable environment for single-parent families to raise their children.

• Health Policy and Management
• /
• v.21 no.3
• /
• pp.425-456
• /
• 2011

Background: Organizations in the pharmaceutical industry are highly dependent on the institutional environment. The introduction of pharmacoeconomics to the decision-making on the price and reimbursement decisions became strong constraints to pharmaceutical companies in Korea. As little is known about the issue on organization-environment interaction in the healthcare field, this study aimed to figure out how pharmaceutical companies adapted to the environmental changes. Methods: A multicase study method was used, selecting eight cases among multi-national pharmaceutical companies in South Korea. In-depth interviews were conducted with the managers of these organizations, and secondary data were reviewed to complement the interviews. Results: Pharmaceutical companies viewed the new policies as a big threat and sought for actions against them. One of the most distinguishing organizational changes was to construct a Market Access department. Other strategies managing the environment such as co-optation, forecasting, and bargaining were also implemented. These changes were consistent with the predictions of Resource Dependency Theory and Institutional Theory. Conclusions: The interactions between pharmaceutical companies and institutional environments in healthcare were first explored. This study presents a new perspective on how organizations change and the motives for the changes. The findings of this case study will form the basis of further empirical studies.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.722-733
• /
• 2006

In scalable streaming application, there are two important knobs to tune to effectively exploit the underlying network resource and to maximize the user perceivable quality of service(QoS): layer selection and packet scheduling. In this work, we propose Semantics Aware Packet Scheduling (SAPS) algorithm to address these issues. Using packet dependency graph, SAPS algorithm selects a layer to maximize QoS. We aim at minimizing distortion in selecting layers. In inter-frame coded video streaming, minimizing packet loss does not imply maximizing QoS. In determining the packet transmission schedule, we exploit the fact that significance of each packet loss is different dependent upon its frame type and the position within group of picture(GOP). In SAPS algorithm, each packet is assigned a weight called QoS Impact Factor Transmission schedule is derived based upon weighted smoothing. In simulation experiment, we observed that QOS actually improves when packet loss becomes worse. The simulation results show that the SAPS not only maximizes user perceivable QoS but also minimizes resource requirements.