• Title/Summary/Keyword: Delay Time Cost

Search Result 435, Processing Time 0.027 seconds

A Study on the Feasibility of the Timing for the Implementation of Energy-Saving Plan of Buildings Based on the Approval of Business Plan and Construction Permit (건축물에너지절약계획서의 사업계획승인, 건축허가에 따른 적용시점의 타당성 연구)

  • Kim, Dae-Won;Kim, Young-Il;Chung, Kwang-Seop
    • Journal of Energy Engineering
    • /
    • v.21 no.3
    • /
    • pp.265-270
    • /
    • 2012
  • The delay in the construction permit for the building, which obtained the approval of business proposal, may lead to a difference in the maintenance cost ranging between 20% and 30% in the neighborhood where the residents moved in, along with the new project under construction in the surrounding area amidst rigorous regulations that aim to promote energy-saving and the heightened interest of the public in energy conservation, and such problem would become the major source of serious public complaints. Thus, the energy-saving plan needs to be prepared when the approval is granted to the business plan. In order to prevent public complaints or ensure effectiveness of government's energy plan, it may be effective to apply the energy-saving plan based on current standards upon the award of construction permit when two years have elapsed since the date of the scheduled commencement of construction or when the start of construction is delayed as stipulated in the Article 18 of the Enforcement Decree of Housing Act. If the energy-saving plan and related technologies are merely the parts of license and permit process without fully serving their purposes and functions, it would be waste of time to deploy a lot of workforce and review and seek consultation. The government or owners of buildings need to fully understand the energy-saving aspects and exert effort to enhance the energy efficiency of buildings.

Development of CPLD technology mapping control algorithm for Sequential Circuit under Time Constraint (시간제약 조건하에서 순차 회로를 위한 CPLD 기술 매핑 제어 알고리즘 개발)

  • Youn, Chung-Mo;Kim, Jae-Jin
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.36T no.4
    • /
    • pp.71-81
    • /
    • 1999
  • We propose a new CPLD(Complexity Programmable Logic Device) technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG(Directed Acyclic Graph) type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result, it makes delay time and the number of CLBs, run-time to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB(Configurable Logic Block). In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces run-time and the number of CLBs much more than the TEMPLA.

  • PDF

An Efficient CPLD Technology Mapping considering Area under Time Constraint (시간 제약 조건하에서 면적을 고려한 효율적인 CPLD 기술 매핑)

  • Kim, Jae-Jin;Kim, Hui-Seok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.1
    • /
    • pp.79-85
    • /
    • 2001
  • In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint(TMFCPLD). This technology mapping algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. This method is for reason to reduce area and improve total run time of circuits by TEMPLA proposed previously. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Initial cost of each node are the number of OR-terms that it have. Among mappable clusters, clusters of which the number of multi-level is least is selected, and the graph is partitioned. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by 62.2% than those of DDMAP. And reduced the number of CLBs by 17.6% than those of TEMPLA, and reduced the number of CLBs by 4.7% than those of TMCPLD. This results will give much efficiency to technology mapping for CPLDs.

  • PDF

Service Curve Allocation Schemes for High Network Utilization with a Constant Deadline Computation Cost (상수의 데드라인 계산 비용으로 높은 네트웍 유용도를 얻는 서비스 곡선 할당 방식)

  • 편기현;송준화;이흥규
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.4
    • /
    • pp.535-544
    • /
    • 2003
  • Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.

Intra-MARIO: Mobility Management Protocol to Support Intra-PAN Handover with Route Optimization for 6LoWPAN (Intra-MARIO: 6LoWPAN에서 PAN 내부 핸드오버를 최적화된 경로로 지원하기 위한 이동성 프로토콜)

  • Ha, Min-Keun;Kim, Seong-Hoon;Hong, Sung-Min;Kim, Dae-Young;Yoe, Hyun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.12
    • /
    • pp.1189-1193
    • /
    • 2010
  • Mobility management is one of the most important research issues in 6LoWPAN, Since the IP-WSN application domain is expanded to real-time applications such as healthcare and surveillance systems, a fast and seamless handover becomes an important criterion in 6LoWPAN. However, a draft of IETF 6LoWPAN WG for mobility support does not decrease handover delay. Although LoWMob supports a fast intra-PAN handover. it can be supported when the infrastructure node has the location information of the other nodes in the mobile node's moving direction. In this paper, we propose a fast and seamless mobility protocol to support intra-PAN handover, named intra-MARIO. In intra-MARIO, a parent node of the mobile node preconfigures its handover to the PAN when the parent node detects its movement, thereby reducing the handover delay. Since intra-MARIO also supports route optimization, the mobile node can communicate with its corresponding nodes through the optimal route. In this paper, we analysis the signaling cost and evaluates that the handover can be completed in 20ms by simulation.

The introduction of Traffic Inducement Security System in Korea - Centering on Curriculums - (한국의 교통유도경비 도입방안 -교과과정을 중심으로-)

  • Lee, Sang-Won;Lee,, Seung-Chal
    • Korean Security Journal
    • /
    • no.25
    • /
    • pp.147-164
    • /
    • 2010
  • A variety of work zone including road single-sharing construction add surrounding disorder and increase inconvenience of vehicles and pedestrians and furthermore danger of traffic accidents, which sometimes result in human life damages. Traffic delay due to vehicles and users generating in the course of using large-scale multiplex facilities bring about a great economic loss. Now, a lot of regulations and laws related to traffic safety system on construction sites etc. are established, but can not display efficacy desirably. It brings about continuous economic loss due to human life accidents and delay. For the purpose of solving the problems, it is necessary to import systems such as traffic inducement Security (Japan) and traffic controller (CANADA, USA) This article suggest how improve civil safety and reduce Social cost. therefore This thesis aims at analyzing advanced cases of foreign countries, looking into Korean status, and presenting importing ways of traffic inducement Security appropriate to Korea. It is reasonable to grant grade1, grade2, and technical experts to traffic inducement Security who pass regulated educations and examinations. In addition, by reversing regulations and laws, it is necessary only those who have the licenses of traffic induction guarder etc. can establish construction sites and disordered places on roads. Theory educations for education time must include basic educations and expert educations. Basic educations must include understanding regulations and laws and understanding affairs. Expert educations must include traffic control, safety educations, understanding of traffic accidents, operation of traffic control facilities, and traffic accident settlements. Traffic affairs educations must include traffic induction affairs in sites (hand signals, safety material establishment, traffic accident settlements, and urgent treatments).

  • PDF

An Extraction of Inefficient Factors and Weight for Improving Efficiency of the Curtain wall Life Cycle Process (커튼월 Life Cycle Process의 효율성 향상을 위한 비효율 요인 밑 중요도 도출)

  • Jung Soon-Oh;Kim Yea-Sang;Yoon Su-Won;Chin Sangyoon
    • Korean Journal of Construction Engineering and Management
    • /
    • v.6 no.4 s.26
    • /
    • pp.101-112
    • /
    • 2005
  • Recently, a curtain wall construction is a exterior finishing components which is most used for shortening time in high-rise building as well as the class of key management factors in cost and schedule control. Also, it is recognized that an effective management for curtain wall process is a major subject to accomplish the project successfully. However, as the current management for curtain wall construction is focused on the construction stage, it makes problems such as errors in business performance, rework by mistakes and duplications, errors and omissions by ineffective information management and there has never been any efficient management from a view of the entire Curtain Wall Life-cycle process. Therefore, the aim of this study is to suggest a stage check point for process improvement in the curtain wall Life-cycle process through current curtain wall process analysis, and then to investigate the cause of waste factors using the Muda method from the Toyota Production System and extract the weighted effects of the waste factors using the analytical hierarchy process method. According to the result, Most of the inefficient factors happened in architectural design stage of the entire curtain wall Life-cycle process and my research identified that detail factors of them are a delay of decision making and an approval in changes, a deficit of engineering capacity and a delay of approval in architectural design drawings by owner, etc.

Adaptive Limited Dynamic Bandwidth Allocation Scheme for EPON (EPON 시스템의 적응적 Limited 동적 대역 할당 방식)

  • Hwang Jun-Ho;Yoo Myung-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.449-455
    • /
    • 2006
  • Due to advance in multimedia applications and integrated Internet services, the optical access networks have been actively studied. In particular, Ethernet passive optical network (EPON) has received much attention due to high bandwidth provision with low cost. In EPON system, the data transmission is carried out in two directions: downstream (from OLT to ONU) and upstream (from ONU to OLT). The downstream data is broadcasted to every ONUs, while the upstream data is point-to-point transmitted between each ONU and OLT, where the uplink is shared by all ONUs in the form of TDMA. The bandwidth allocation algorithm is required to efficiently manage the bandwidth on the uplink. The limited algorithm was proposed to enhance the capability of dynamic bandwidth allocation. In this paper, we propose the adaptive limited algorithm to enhance the shortcomings of limited algorithm. The adaptive limited algorithm enhances the dynamics on bandwidth allocation, and at the same time controls the fairness on packet delay. Through the computer simulations, it is shown that the adaptive limited algorithm achieves high dynamic on bandwidth allocation, maintains a good fairness on packet delay between ONUs, and keeps the fairness on the bandwidth on the demand basis.

A Study of Expressway Tollbooth Metering Effect (고속도로 영업소 미터링 효과에 관한 연구)

  • Im, Jin-Won;Yoon, Jae-Yong;Lee, Eui-Eun;Kim, Kwan-Min
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.10 no.4
    • /
    • pp.1-10
    • /
    • 2011
  • According to the worldwide efforts to reduce greenhouse gases consequent upon climatic change, the field of road traffic is also making diverse efforts to reduce the emissions of greenhouse gases. Among these, the exhaust gases from vehicles, the so-called main culprit of the greenhouse gases will take place the more as delay and tie-up of vehicles ever take place. Accordingly, as a scheme for reducing the delay & tie-up of vehicles, it's possible to bring up the idea of supply of new facilities and management of the existing facilities; recently, a lot more focus is being put on the management of the existing facilities due to enormous amounts of construction cost. In the midst of growing concern for traffic demand management policy, it's about the time we should do research on the tollbooth metering on the expressway whose research is almost non-existent home and abroad. As a traffic demand management policy coming to happen in case of the management of pay expressway like Japan and Korea, this research analyzed the contents of tollbooth metering, its effect and its subsequent convenience. Especially as a tool for effect analysis, this research made an analysis using VISSIM-a micro-simulation tool. As the tollbooth metering promoted, as a part of green traffic promotion strategy, is expected to contribute to improvement in traffic flow and reduction in carbon emissions, etc. It seems that there needs to be continuous research work on the management plan & revitalization plan for maximization of its effect later as well.

A OSPF Routing Scheme based on Energy Profiles and Its Characteristics for QoS-Aware Energy Saving(QAES) in IP Core Networks (IP 네트워크에서 QoS-Aware Energy Saving(QAES)을 위한 Energy Profile 기반 OSPF 라우팅 방식 및 특성)

  • Seo, Yusik;Han, Chimoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.1
    • /
    • pp.9-21
    • /
    • 2016
  • Nowadays various methods for energy saving have been studied in IP networks. This paper suggests a 2-phase OSPF routing method for energy saving on IP networks having various energy profiles and analyzes its characteristics. The phase-1 of the routing is an OSPF routing method considering the energy cost of devices besides existing metrics to minimize energy consumption. In the phase-2 of the routing, it makes core nodes go into sleep sate for energy saving and reroutes the paths affected by sleeping core nodes. At this time, we confirm that the characteristics of mean delay and energy efficiency can be satisfied by limiting an allowable hop number in the reroute paths, and utilization rate of nodes and links for assuring energy saving and network-level QoS. Since the efficiency of energy saving and delay characteristics differ according to selection methods of core nodes to go into sleep state, it is that the a method of core node selection based on MP(minimum_path) is more excellent than others in terms of network-level QoS and energy saving in IP networks.