• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.1-10
• /
• 1998

This paper is to propose an algorithm named as DYSAC to find the critical path(the longest sensitizable path) in a large digital circuit, whose purpose is to reduce the time to find critical path and to find critical paths of the circuits for which the previous methods could not find one. Also a set of path sensitization criteria named as DYPSEC is proposed, which is used to select a path from input to the output inside the DYSAC. The DYSAC consists of two sub-algorithms; the level assignment algorithm to assign a level to each node and the critical path selection algorithm to select the sensitizable path. The proposed algorithm was implemented with C-language on SUN Sparc and applied to the ISCAS'85 benchmark circuits to make sure if it works correctly and finds the correct critical path. Also, the results from the experiments were compared to the results from the previous works. The comparison items were the ability to find the critical path and the speed, in both of which the proposed algorithm in this paper shows better results than others.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.691-693
• /
• 2004

0.18$\mu\textrm{m}$ 표준 셀 라이브러리로 구현할 때 2.69㎱의 임계 경로 지연을 가지는 SIMD구조의 포화 덧셈기를 설계하였다. 기존의 설계에서 임계 경로를 구성하는 CLA를, 8비트까지만 자리올림(Carry)이 전파될 때 정확한 계산을 보장하는 근사 덧셈기의 형태로 설계한 결과, 임계 경로 시간 지연을 약 22% 감소시킬 수 있었다. 파이프라인 구조 프로세서에서 사용될 포화 덧셈기의 근사계산이 실패하는 경우에는, 추가적인 2개의 클록주기 동안 재 계산을 수행하게 된다.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.677-687
• /
• 2001

The critical path has been widely applied to many areas of computer engineering especially a directed acyclic graph. Its concept can also be useful in the context of a workflow. The workflow critical path is defined as a path which has the longest average execution time from the start activity to the end activity of workflow. Because there can be several concurrently executed workflow instances for a specific workflow a new method to determine the critical path should be developed. In this paper we specify our workflow queuing network model from which we can easily analyze many workflow characteristics. Based on this workflow model. we propose a method to identify the critical path In addition, we show come workflow areas which can utilze the critical path.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.1-16
• /
• 1999

Critical is used frequently in many test generation procedures. In this paper, the critical-pair is defined as a extended concept of critical. Also, the criticality, the critical rate, the critical number, and the critical setting rate are defined which represent the characteristics of critical. In these elements, it is proved that the usage of the critical-pair is more efficient than that of the single critical. in FFR, it is also showed that the critical-pair is more efficient in evaluation number of critical values when the test pattern is generated, in the number of searching lines, and the test generation time. The experimental results of the critical-pair on the ISCAS85 benchmark test circuits are compared and analyzed to the single critical using simulation.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.20 no.1
• /
• pp.137-151
• /
• 2017

The space between urban buildings becomes a waterway during rain events and requires a boundary condition in numerical calculations on grids to separate overland storm flows from building areas. Minimization of the building data distortion as a boundary condition is a necessary step for generating accurate calculation results. A building generalization is used to reduce the distortion of building shapes and areas during a raster conversion. The objective of this study was to provide the appropriate threshold value for building generalization and grid size in a numerical calculation. The impact of building generation on the connectivity of urban storm waterways were analyzed for a general residential area. The building generalization threshold value and the grid size for numerical analysis were selected as the independent variables for analysis, and the number and area of sinks were used as the dependent variables. The values for the building generalization threshold and grid size were taken as the optimal values to maximize the building area and minimize the sink area. With a 3 m generalization threshold, sets of $5{\times}5m$ to $10{\times}10m$ caused 5% less building area and 94.4% more sink area compared to the original values. Two sites representing general residential area types 2 and 3 were used to verify building generalization thresholds for improving the connectivity of storm waterways. It is clear that the recommended values are effective for reducing the distortion in both building and sink areas.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.138-147
• /
• 2002

The concept of the critical path in the workflow is important because it can be utilized In many issues in workflow systems, e.g., workflow resource management and workflow time management. However, the critical path in the contest of the workflow has not been much addressed in the past. This is because control flows in the workflow, generally including sequence, parallel, alternative, iteration and so on, are much more complex than those in the ordinary graph or network. In this paper we first describe our workflow model that has considerable work(low control constructs. They would provide the sufficient expressive power for modeling the growing complexities of today's most business processes. Then, we propose a method to systematically determine the critical path in a workflow schema built by the workflow control constructs described in our workflow model.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.653-656
• /
• 2010

MANET(Mobile Ad-hoc Network)에서는 노드들의 에너지가 제한적이기 때문에 에너지 효율적인 경로 설정이 중요한 이슈이다. 본 논문에서는 AOMDV(Ad-hoc On-demand Multipath Distance Vector)를 기반으로 노드의 에너지를 고려한 경로 설정과 유지 기법이 추가된 라우팅 프로토콜을 제안한다. 본 논문에서 제안한 다중경로 라우팅 프로토콜은 노드의 에너지 잔량을 고려하여 경로를 설정하기 때문에 에너지 고갈로 인한 경로 재설정 횟수를 줄일 수 있으며, 노드의 에너지 잔량 임계치를 설정하여 노드의 에너지 잔량이 임계치 이하가 되면 에러 패킷을 전송함으로서 경로 변경 및 재설정시 생기는 데이터의 손실과 전송지연을 줄일 수 있다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.141-150
• /
• 2012

This paper suggests a critical path search algorithm that can easily draw PERT/GANTT chart which manages and plans a project schedule. In order to evaluate a critical path that determines the project schedule, Critical Path Method (CPM) is generally utilized. However, CPM undergoes 5 stages to calculate the critical path for a network diagram that is previously designed according to correlative relationship and execution period of project execution activities. And it may not correctly evaluate $T_E$ (The Earliest Time), since it does not suggest the way how to determine the sequence of the nodes activities that calculate the $T_E$. Also, the sequence of the network diagram activities obtained from CPM cannot be visually represented, and hence Lucko suggested an algorithm which undergoes 9 stages. On the other hand, the suggested algorithm, first of all, decides the sequence in advance, by reallocating the nodes into levels after Breadth-First Search of the network diagram that is previously designed. Next, it randomly chooses nodes of each level and immediately determines the critical path only after calculation of $T_E$. Finally, it enables the representation of the execution sequence of the project activity to be seen precisely visual by means of a small movement of $T_E$ of the nodes that are not belonging to the critical path, on basis of the $T_E$ of the nodes which belong to the critical path. The suggested algorithm has been proved its applicability to 10 real project data. It is able to get the critical path from all the projects, and precisely and visually represented the execution sequence of the activities. Also, this has advantages of, firstly, reducing 5 stages of CPM into 1, simplifying Lucko's 9 stages into 2 stages that are used to clearly express the execution sequence of the activities, and directly converting the representation into PERT/GANTT chart.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.893-900
• /
• 1998

본 논문에서는 잡음 예측 필터를 적용한 멀티 캐리어 CDMA 병렬 동기 시스템을 위한 임계치의 통계적인 해석에 중점을 둔다. 시스템 성능 척도로써 평균 동기 획득 시간을 검파 확률과 오보 확률의 관점에서 유도한다. 다중 경로 페이딩 채널에서 평균 동기 획득 시간을 유도한다. 수치해석 결과, 잡음 예측 필터를 적용한 멀티 캐리어 CDMA 병렬 동기 해석에 있어서 임계치의 통계적인 특성을 이용한 동기 해석이 임계치의 근사화에 의한 동기 해석보다 정확한 결과를 보임을 알 수 있다. 또한, 잡음 예측 필터를 적용한 멀티 캐리어 CDMA 별렬 동기 시스템이 넓은 범위의 SNR에 대해서 평균 동기 획득 시간을 최소화할 수 있는 임계치를 검파할 수 있음을 확인할 수 있다.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.215-219
• /
• 2005

Generally, the mobile nodes in MANET have the limited power capacity available for actual communications. Thus, the power management is very important for packet routing or forwarding. Although MTPR, MBCR and MMBCR are proposed to treat the problem of power consumption, there have been few researches resolving the link breakdown that is occurred by the power exhaustion during transmission. In this sense, the reliable scheme should be required to ensure the routing connectivity. In this paper, we propose three schemes to enforce the routing connectivity. If the signal strength is dropped below a signal threshold, the candidate route is previously selected to prepare the link breakdown. Also, on multi-channel, we propose the lifetime increment scheme of a node that it manage its available power to the needed power of a new link. The simulation results show the enforcement of the link connectivity and the performance improvements of the delay time through the effective connection management.