• Title/Summary/Keyword: Critical path method

Search Result 224, Processing Time 0.025 seconds

A PATH ENUMERATION APPROACH FOR CRITICAL ANALYSIS IN PROJECT NETWORKS WITH FUZZY ACTIVITY DURATIONS

  • Siamak Haji Yakchali
    • International conference on construction engineering and project management
    • /
    • 2011.02a
    • /
    • pp.575-581
    • /
    • 2011
  • A novel approach for analysis of criticality with respect to path and to activity in networks with fuzzy activity durations is proposed. After recalling the Yager ranking method, the relative degree of criticality of activities and paths are defined. An efficient algorithm based on path enumeration to compute the relative degree of criticality of activities and paths in networks with fuzzy durations is proposed. Examples of former researches are employed to validate the proposed approach. The proposed algorithm has been tested on real world project networks and experimental results have shown that the algorithm can calculate the relative degree of criticality of activities and paths in a reasonable time.

  • PDF

New Transistor Sizing Algorithms For CMOS Digital Designs (CMOS 디지틀 설계를 위한 트랜지스터 크기의 최적화기법)

  • 이상헌;김경호;박송배
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.3
    • /
    • pp.68-76
    • /
    • 1994
  • In the automatic transistor sizing with computer for optimizing delay and the chip area of CMOS digital circuits, conventionally either a mathematical method or a heuristic method has been used. In this paper, we present a new method of transistor sizing, a sort of combination of the above two methods, in which the mathematical method is used for sizing of critical paths and the heuristic method is used for desizing of non-critical paths. In order to reduce the overall problem dimension, a basic block called an extended stage is introduced which includes a basic stage, parallel transistors and complementary part. Optimization for multiple critical paths is formulated as a problem of area minimization subject to delay constraints and is solved by the augmented Lagrange multiplier method. The transistor sizes along non-critical paths are decreased successively without affecting the critical path delay times. The proposed scheme was successfully applied to several test circuits.

  • PDF

An Area Optimization Method for Digital Filter Design

  • Yoon, Sang-Hun;Chong, Jong-Wha;Lin, Chi-Ho
    • ETRI Journal
    • /
    • v.26 no.6
    • /
    • pp.545-554
    • /
    • 2004
  • In this paper, we propose an efficient design method for area optimization in a digital filter. The conventional methods to reduce the number of adders in a filter have the problem of a long critical path delay caused by the deep logic depth of the filter due to adder sharing. Furthermore, there is such a disadvantage that they use the transposed direct form (TDF) filter which needs more registers than those of the direct form (DF) filter. In this paper, we present a hybrid structure of a TDF and DF based on the flattened coefficients method so that it can reduce the number of flip-flops and full-adders without additional critical path delay. We also propose a resource sharing method and sharing-pattern searching algorithm to reduce the number of adders without deepening the logic depth. Simulation results show that the proposed structure can save the number of adders and registers by 22 and 26%, respectively, compared to the best one used in the past.

  • PDF

A Study on the Optimal Routing Technique for the Improvement of Voltage Stability in Radial Power System (방사상 전력계통의 전압안정도 향상을 위한 최적 라우팅 기법에 관한 연구)

  • Kim, Byung-Seop;Shin, Joong-Rin;Park, Jong-Bae
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.51 no.11
    • /
    • pp.568-576
    • /
    • 2002
  • This paper presents a new algorithm for the enhancement of voltage stability by optimal routing (OR) technique. A new voltage stability index (VSI) for optimal routing is also proposed by using theories of critical transmission path based on voltage phasor approach and equivalent impedance method. Furthermore, the proposed algorithm automatically detect the critical transmission path to critical transmission path to critical load which are faced to voltage collapse due to additional real or reactive loading. We also adopt a improved branch exchange (IBE) algorithm based on a tie branch power (TBP) flow equation to apply the OR technique. The proposed IBE algorithm for the VSI maximizing can effectively search the optimal topological structures of distribution feeders by changing the open/closed states of the sectionalizing and tie switches. The proposed algorithm has been evaluated with the practical IEEE 32, 69 bus test systems and KEPCO 148 bus test system to show favorable performance.

NHS: A Novel Hybrid Scheduling for ILP

  • You, Song-Pei;Mashiro Sowa
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.310-313
    • /
    • 2000
  • This paper presents a new scheduling method for ILP processing called NHS(Novel Hybrid Scheduling). It concerns not only exploiting as much ILP as possible like other state-of-the-art scheduling scheme, but also choosing the most important instructions among many ready-to-execute instructions to processors in order to reduce the execution time under limited hardware resource. At the heart of NHS is a conception called CCP(Complex Critical Path), an extension of CP(Critical Path). By using CCP, compiler not only can get a global information of the whole program to extract ILP, but also can collecting data dependence information and control flow information. The paper also presents the simulation results, to date, of our attempts to study the NHS scheduling method. The results indicate good potential for this scheduling method.

  • PDF

Task-Technology Fit in Construction Scheduling

  • Yang, Juneseok;Arditi, David
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • pp.117-121
    • /
    • 2015
  • Construction managers use scheduling methods to improve the outcome of their project. Despite the many obvious advantages of the critical path method (CPM), its use in construction has been limited. Understanding the reasons why CPM is not used as extensively as expected could improve its level of acceptance in the construction industry. The link between construction scheduling methods and the tasks expected to be performed by schedulers has been an on-going concern in the construction industry. This study proposes a task-technology fit model to understand why CPM is not used as extensively as expected in construction scheduling. A task-technology fit model that aims to measure the extent to which a construction scheduling method functionally matches the tasks expected to be performed by the scheduling staff. The model that is proposed is an answer to the lack of proper instruments for evaluating the extent to which scheduling methods are used in the industry.

  • PDF

Staffing-Technology Fit in Construction Scheduling

  • Yang, Juneseok;Arditi, David
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • pp.631-635
    • /
    • 2015
  • Construction managers use scheduling methods to improve the outcome of their project. In spite of the many obvious advantages of the critical path method (CPM), its use in construction has been limited. Understanding the reasons why CPM is not used as extensively as expected could improve its level of acceptance in the construction industry. The link between construction scheduling methods and the capabilities of the scheduling staff has been an on-going concern in the construction industry. This study proposes a staffing-technology fit model to understand why CPM is not used as extensively as expected in construction scheduling. A staffing-technology fit model that aims to measure the extent to which a construction scheduling method matches the staff's experience, know-how and capabilities. The model that is proposed is an answer to the lack of proper instruments for evaluating the extent to which scheduling methods are used in the industry.

  • PDF

Primary user localization using Bayesian compressive sensing and path-loss exponent estimation for cognitive radio networks

  • Anh, Hoang;Koo, Insoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.10
    • /
    • pp.2338-2356
    • /
    • 2013
  • In cognitive radio networks, acquiring the position information of the primary user is critical to the communication of the secondary user. Localization of primary users can help improve the efficiency with which the spectrum is reused, because the information can be used to avoid harmful interference to the network while simultaneity is exploited to improve the spectrum utilization. Despite its inherent inaccuracy, received signal strength based on range has been used as the standard tool for distance measurements in the location detection process. Most previous works have employed the path-loss propagation model with a fixed value of the path loss exponent. However, in actual environments, the path loss exponent for each channel is different. Moreover, due to the complexity of the radio channel, when the number of channel increases, a larger number of RSS measurements are needed, and this results in additional energy consumption. In this paper, to overcome this problem, we propose using the Bayesian compressive sensing method with a calibrated path loss exponent to improve the performance of the PU localization method.