• Title/Summary/Keyword: Delay Time Cost

Search Result 435, Processing Time 0.027 seconds

A Study on Effects of Software Process Improvement for Competitive Advantage (소프트웨어 프로세스 개선 노력이 국내 SI 업체의 경쟁우위에 미치는 영향에 관한 연구)

  • 김성희;이경아;이주헌
    • Journal of Information Technology Applications and Management
    • /
    • v.9 no.3
    • /
    • pp.113-127
    • /
    • 2002
  • The effort for software process improvement is lately surging its interest though it does not satisfy both developer and receiver In terms of low productivity, quality, delay and increasing cost. According to current research, software process improvement contributes to improvement of productivity, its Duality, reduction of development time and cost, and the prediction of the time limit for delivery, which means software process improvement affects competitive advantage among developers. The latest research is whether the investment for information technology substantially had effect on improvement of productivity. That is, software process improvement and maturity of software industries has influence upon economic efficiency and as a result, it plays an important role in whole industries. This research is that how does software process improvement using CMM (Capability Maturity Model) and SPICE (Software Process Improvement and Capability dEtermination) have a effect on factors of software engineering, and how does it have influence upon competitive advantage among SI firms. For this research, reusability, customizability, participation, and review & inspection are set to independent variable and process flexibility and process predictability are set to mediate Variable. Finally, competitive advantage among SI firms Is set to dependent variable. The targets for survey are laborers who work for SI firms. The result of this research is as follows: 1 ) Reusability, Customizability and participation is not rejected but review and Inspection is rejected in process flexibility which has significant level 0.05. 2) Reusability, Customizability and participation is not rejected but review and inspection Is rejected in process predictability which has significant level 0.05. 3) Process flexibility is not rejected and process predictability Is rejected in the competitive advantage of 51 industries which has significant level 0.05

  • PDF

Efficient Virtual Machine Resource Management for Media Cloud Computing

  • Hassan, Mohammad Mehedi;Song, Biao;Almogren, Ahmad;Hossain, M. Shamim;Alamri, Atif;Alnuem, Mohammed;Monowar, Muhammad Mostafa;Hossain, M. Anwar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.5
    • /
    • pp.1567-1587
    • /
    • 2014
  • Virtual Machine (VM) resource management is crucial to satisfy the Quality of Service (QoS) demands of various multimedia services in a media cloud platform. To this end, this paper presents a VM resource allocation model that dynamically and optimally utilizes VM resources to satisfy QoS requirements of media-rich cloud services or applications. It additionally maintains high system utilization by avoiding the over-provisioning of VM resources to services or applications. The objective is to 1) minimize the number of physical machines for cost reduction and energy saving; 2) control the processing delay of media services to improve response time; and 3) achieve load balancing or overall utilization of physical resources. The proposed VM allocation is mapped into the multidimensional bin-packing problem, which is NP-complete. To solve this problem, we have designed a Mixed Integer Linear Programming (MILP) model, as well as heuristics for quantitatively optimizing the VM allocation. The simulation results show that our scheme outperforms the existing VM allocation schemes in a media cloud environment, in terms of cost reduction, response time reduction and QoS guarantee.

Effectiveness Analysis of Transforming Many-Legs Type Intersection into Roundabout in Jeju (제주지역 다지교차로의 회전교차로 교통시스템 변환에 따른 효과분석)

  • Lee, Dong Weon;Ko, Sang Ick;Lee, Dong Wook
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.32 no.6D
    • /
    • pp.623-636
    • /
    • 2012
  • Roundabout is an intersection that allows vehicles to pass through the intersection by circulating the circular traffic island at the center of the intersection. In this study, a comparative analysis was conducted on roundabout at five locations in order to deduce the operational result and financial effect of roundabout and signal intersection. As for the operational result, it was found that roundabout showed improvement effect in the average delay per vehicle compared to that of signal intersection by minimum of 65.6% and maximum of 91.77%. it was found that roundabout showed financial cost-saving effect in the traffic congestion cost compared to that of signal operation by minimum of 58.59% and maximum of 81.69% per year. It can be known from these analysis results that roundabout has significant operational effects under certain amount of traffic volume by allowing vehicles to pass through the intersection in a continuous way without much waiting time and stoppage from signal control.

Dynamic Class Mapping Mechanism for Guaranteed Service with Minimum Cost over Differentiated Services Networks (다중 DiffServ 도메인 상에서 QoS 보장을 위한 동적 클래스 재협상 알고리즘)

  • 이대붕;송황준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.697-710
    • /
    • 2004
  • Differentiated services (DiffServ) model has been prevailed as a scalable approach to provide quality of service in the Internet. However, there are difficulties in providing the guaranteed service in terms of end-to-end systems since differentiated services network considers quality of service of aggregated traffic due to the scalability and many researches have been mainly focused on per hop behavior or a single domain behavior. Furthermore quality of service may be time varying according to the network conditions. In this paper, we study dynamic class mapping mechanism to guarantee the end-to-end quality of service for multimedia traffics with the minimum network cost over differentiated services network. The proposed algorithm consists of an effective implementation of relative differentiated service model, quality of service advertising mechanism and dynamic class mapping mechanism. Finally, the experimental results are provided to show the performance of the proposed algorithm.

Optimal Inventory Management for Rebar Fabrication Process in Construction Process (건설현장 철근작업 프로세스상의 적정 자재재고 관리 방안에 관한 연구)

  • Jung, Do-Young;Park, Sang-Hyuk;Kwak, Soo-Nam;Kim, Hyoung-Kwan;Han, Seung-Heon
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 2006.11a
    • /
    • pp.702-707
    • /
    • 2006
  • There have been certain extent of material inventory in construction site because of difficulties in ordering by small quantity, strategy of securing future requirements and prevention of delay. However, carrying these inventory entails a financial cost called inventory holding cost and decrease construction productivity, so proper inventory management in construction industry is important for construction efficiency and cost reduction. This study tries to find analytical method of inventory management. It includes ordering decision which decide how much to order and when to order. Setting these strategies including deciding safety inventory, input and ouput variability are able to controled.

  • PDF

A New Mobility Management Scheme Using Pointer Forwarding in Proxy Mobile IPv6 Networks (Proxy Mobile IPv6 네트워크에서 포인터 포워딩을 이용한 이동성 관리기법)

  • Yi, Myung-Kyu;Kim, Hyung-Heon;Park, Seok-Cheon;Yang, Young-Kyu
    • The KIPS Transactions:PartC
    • /
    • v.17C no.1
    • /
    • pp.109-118
    • /
    • 2010
  • Proxy mobile IPv6 (PMIPv6) protocol is a network-based mobility management protocol to support mobility for IPv6 nodes without host involvement. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. This increases network overhead on the LMA, wastes network resources, and lengthens the delay time. Therefore, we propose a new mobility management scheme for minimizing signaling cost using the pointer forwarding. Our proposal can reduce signaling costs by registration with the neighbor MAG instead of the remote LMA using the pointer forwarding. The cost analysis using imbedded Markov chain presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

Efficient Multiple Joins using the Synchronization of Page Execution Time in Limited Processors Environments (한정된 프로세서 환경에서 체이지 실행시간 동기화를 이용한 효율적인 다중 결합)

  • Lee, Kyu-Ock;Weon, Young-Sun;Hong, Man-Pyo
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.732-741
    • /
    • 2001
  • In the relational database systems the join operation is one of the most time-consuming query operations. Many parallel join algorithms have been developed 개 reduce the execution time Multiple hash join algorithm using allocation tree is one of the most efficient ones. However, it may have some delay on the processing each node of allocation tree, which is occurred in tuple-probing phase by the difference between one page reading time of outer relation and the processing time of already read one. This delay problem was solved by using the concept of synchronization of page execution time with we had proposed In this paper the effects of the performance improvements in each node of the allocation tree are extended to the whole allocation tree and the performance evaluation about that is processed. In addition we propose an efficient algorithm for multiple hash joins in limited number of processor environments according to the relationship between the number of input relations in the allocation tree and the number of processors allocated to the tree. Finally. we analyze the performance by building the analytical cost model and verify the validity of it by various performance comparison with previous method.

  • PDF

Development of CPLD technology mapping algorithm improving run-time under Time Constraint (시간적 조건에서 실행시간을 개선한 CPLD 기술 매핑 알고리즘 개발)

  • 윤충모;김희석
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.3
    • /
    • pp.35-46
    • /
    • 1999
  • In this paper, we propose a new CPLD technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm. a given logic equation is constructed as the DAG 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 Cl.B. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces run-time much more than the TMCPLD.

Application of Accrual Basis for Calculation of Prolongation Cost in Construction Projects (공기연장 추가간접비 산정기준의 발생주의방식 적용 연구)

  • Jeong, Kichang;Lee, Jaeseob
    • Korean Journal of Construction Engineering and Management
    • /
    • v.19 no.5
    • /
    • pp.111-120
    • /
    • 2018
  • Recently, Domestic public construction projects are experiencing a great deal of disputes because of the growing uncertainty about the criteria for calculating the prolongation cost. In addition, researchers have been studying various systems and proper cost estimates in an effort to reduce the uncertainty of these systems and the occurrence of disputes. However, there is no standard yet for social consensus. Meanwhile, The study on the classification system according to the recognition standard of accounting has been systematically studied. As a result, the concepts of accrual and cash basis are defined separately. The purpose of this study is to verify the possibility of applying the concept of 'accrual basis' to the Standard for calculation of prolongation cost. Therefore, As a result of analyzing the occurrence pattern of Job-site overhead cost, it is confirmed that actual costs can not be calculated by the cash-basis method. In particular, the implications of the necessity of the accrual-basis method should be more strictly indicated in the case of items such as indirect labor costs and welfare benefits. In addition, the contractor 's claim report and the appraisal report were examined. As a result, it was confirmed that the calculation situations of prolongation costs are biased to the cash-basis method. In this way, it is suggested that necessary to supplement the calculation standard of the actual costs from the point of view of accrual basis.

A Centralized DESYNC Scheme in Small-Scale Wireless Networks (소규모 무선 네트워크에 적합한 중앙제어 방식의 DESYNC 개선 방안)

  • Lee, Nam-Kwon;Hyun, Sang-Hyun;Lee, Je-Yul;Lee, Ku-Won;Yang, Dong-Min
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.3
    • /
    • pp.731-740
    • /
    • 2015
  • In the recent days, interests in machine-to-machine communication schemes in small-scale networks has been increasing with growing demands. TDMA(Time Division Multiple Access) can be used as a multiple access method in small-scale networks. However, time synchronization for TDMA is complicated or needs additional equipments. Such a large cost is not suitable for small-scale networks. We propose, BC-DESYNC, a efficient time synchronization for small-scale networks by extending DESYNC(DESYNChronization). DESYNC takes a long time to complete synchronization and doesn't guarantee the synchronization delay. BC-DESYNC uses CU(Central Unit) that performs a centralized control to achieve the 2-hop communication and guarantees the synchronization completion time by using Mimic firing and C-DESYNC scheme.