• 제목/요약/키워드: wait time

검색결과 206건 처리시간 0.025초

OR 모델 기반의 분산 교착상태 발견 및 복구 기법 (A Distributed Deadlock Detection and Resolution Algorithm for the OR Model)

  • 이수정
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제29권10호
    • /
    • pp.561-572
    • /
    • 2002
  • 분산시스템에서는 어느 한 사이트가 전체 시스템의 상태 정보를 알 수 없기 때문에 분산 교착상태의 발견은 어려운 문제로 알려져 왔다. 본 논문은 분산 교착상태의 발견 및 해결을 위한 시간 효율적인 알고리즘을 제안한다. 알고리즘의 시작노드는 교착상태 발견을 위한 메시지를 전파하고 이에 대한 응답 정보로부터 wait-for graph를 구축한다. 제시한 알고리즘은 기존에 비해 교착상태를 발견하는데 걸리는 시간을 반으로 단축시키는 장점이 있다. 또한 대부분의 연구결과가 단지 알고리즘의 시작노드가 교착상태에 속하였는지의 여부를 판단할 수 있는 것과는 달리 본 알고리즘은 알고리즘을 수행하는 모든 노드들에 대해 그같은 결과를 말해준다. 이러한 특성으로 인해 교착상태는 보다 신속히 발견될 수 있다. 더우기 이제까지 교착상태의 해결에 대해 무관심하였거나 알고리즘의 시작노드를 중지시킴으로써 해결하였던 것에 반해 본 알고리즘은 효율적이고 상세한 교착상태 해결방법을 제시하였다.

쉐어하우스를 위한 웨이팅 리스트 기반의 O2O 서비스 플랫폼 구현 (Design of the Waiting List based O2O Service Platform for the Share House)

  • 표경수;박진태;김현국;문일영
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2016년도 추계학술대회
    • /
    • pp.681-683
    • /
    • 2016
  • 최근, 공유경제는 일반인들에게 인식이 좋아지면서 급부상하고 있다. 그래서 다양한 분야에서 자신의 물건, 집, 재능 등을 공유하는 현상이 많아지고 있다. 대표적으로 "Airbnb"와 같이 집 주인이 여행이나 출장으로 집을 비워둘 때, 자신의 집을 공유하는 쉐어하우스가 가장 활발하게 거래되고 있다. 쉐어하우스를 통해서 집주인은 비어있는 집을 이용하여 수익을 낼 수 있고, 고객들은 저렴한 가격으로 여행지나 출장지에서 숙소를 이용할 수 있다. 기존 쉐어하우스 시스템에서 고객들은 매번 비어있는 집을 확인해야하고, 깁 주인은 고객들의 입주신청을 기다려야하는 불편함을 없애기 위해 웨이팅리스트를 기반으로 한 서비스 플랫폼을 구현하고자 한다. 이 플랫폼을 통해 고객들은 원하는 집에 입주대기를 신청하여 대기 순서를 부여받아 매번 집을 찾아야하는 불편함을 해소할 수 있을 것이다.

  • PDF

급속금형제작 : 분말주조에 의한 Perfect Shape에의 도전

  • 임용관;김범수;배원병
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1995년도 추계학술대회 논문집
    • /
    • pp.191-194
    • /
    • 1995
  • The business of manufacturing is increasingly becomeing time-compresssing, precise and long-life oiented, owing to various needs form the consumers and harsh global competition. with the emergence of the layer laminate maunfacturing methods, it is possible to prototypes directly from 3D CAD and additive process, the production time and cost have shortened dramatically. However there are some problems like surface-step, dimensional deviation and warp. A newly developed powder casting is suitable for rapid-manufacturing metallic tools. Powder casting can serve as a promising repid tooling method because of high density charateristics and low dimensional shrinkage below 0.1% during sintering and infiltration. By this process, we have realized significant time savings bypassing the wait for prototype tooling and cost savings eliminating the expense of conventional prototype tooling process.

  • PDF

데이터 병렬 프로그램에서 배리어 대기시간의 분석 (Analysis of Barrier Waiting Times in Data Parallel Programs)

  • 정인범
    • 산업기술연구
    • /
    • 제21권A호
    • /
    • pp.73-80
    • /
    • 2001
  • Barrier is widely used for synchronization in parallel programs. Since the process arrived earlier than others should wait at the barrier, the total processor utilization decreases. In this paper, to find the sources of the barrier waiting time, parallel programs are executed on the various grain sizes through execution-driven simulations. In simulation studies, we found that even if approximately equal amounts of work are distributed to each processor, all processes may not arrive at a barrier at the same time. The reasons are that the different numbers of cache misses and instructions within partitioned grains result in the difference in arrival time of processors at the barrier.

  • PDF

RTK-GPS에 의한 일필지 좌표 결정의 정확도 분석에 관한 연구 (A Study on the Accuracy Analysis of Parcel Coordinate by RTK-GPS)

  • 강태석;홍성언
    • 대한공간정보학회지
    • /
    • 제10권1호
    • /
    • pp.37-49
    • /
    • 2002
  • RTK-GPS 측량 방법은 실시간으로 cm 수준의 정확도로 3차원적인 위치정보의 획득이 가능하다. 그리고 수신자료의 처리 방식이 후처리로 이루어지지 않고 실시간으로 이루어지기 때문에 현장에서 직접 일필지의 좌표를 산출해야 하는 지적세부측량에서의 활용이 가능하다. 본 연구에서는 실시간 위치결정 측량시스템인 RTK-GPS(Real Time Kinematic GPS) 측량 방법을 활용하여 일필지 경계점의 위치정보를 도출하고, 이에 대한 정확도를 기존의 TS(Total Station) 측량 성과와 비교 분석함으로써 RTK-GPS 측량의 효용성을 제시하고자 한다.

  • PDF

급속금형제작 (1): 분말주조에 의한 정형(正形)에의 도전 (Rapid Tooling : Challenge to Net Shape by Powder Casting)

  • 임용관;김범수;정해도;배원병
    • 한국정밀공학회지
    • /
    • 제15권7호
    • /
    • pp.85-90
    • /
    • 1998
  • The business of manufacturing is increasingly becoming time-compressing, precise and long-life oriented, owing to various needs from the consumers and harsh global competition. With the emergence of the layer laminate manufacturing method, it is possible to produce prototypes directly from 3D CAD and additive process, the production time and cost have shortened dramatically. However there are some problems like surface-step, dimensional deviation and warp. A newly developed powder casting is suitable for rapid-manufacturing metallic tools. Powder casting can serve as a promising rapid tooling method because of high density characteristics and low dimensional shrinkage below 0.1% during sintering and infiltration. By this process, we have realized significant time savings bypassing the wait for prototype tooling and cost savings eliminating the expense of conventional prototype tooling process.

  • PDF

동시환승(Timed-Transfer) 버스시스템 (Timed-Transfer of Buses)

  • 고승영
    • 대한교통학회지
    • /
    • 제13권4호
    • /
    • pp.105-115
    • /
    • 1995
  • This paper deals with an operation concept of "time-transfer of buses", in which buses arrive a transfer center at the same time and allow passengers to transfer to other bus lines, so that passengerscan go anywhere all the timed-transfere buses operate with only one transfer. This timed-transfer bus system is known as an efficient operating technique which can be adopted in an area with sparsely distrubuted bus demand. A model of timed-transfer is estabilished in terms of vaious factors such as the expected(or average) arrival time, distribution of arrival time, timed-transfer cycle, shceduled departure time, etc. It is assumed that the objective of timed-transfer bus system is to minimize the total transfer waiting time. The optimal schedualed arrival time or buffer time(time required to arrive ealy in consideration of delay) is analyzed for a general case and various speicial cases. It was found that the optiaml buffer time is an inverse funcion of the timed-transfer cycl and increases with the cycle time, assumin g that there is a fixed scheduled departure time at the transfer cetner regardless of whether one or more buses fail to arrive before the scheduled departure time. If buses are to wait uhtil all the buses arrive at the transfer center, that is, the transfer departure time is vairable, the optimal scheduled arrival times can be obtained by a mathmatical programming.

  • PDF

A Bus Data Compression Method on a Phase-Based On-Chip Bus

  • Lee, Jae-Sung
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제12권2호
    • /
    • pp.117-126
    • /
    • 2012
  • This paper provides a method for compression transmission of on-chip bus data. As the data traffic on on-chip buses is rapidly increasing with enlarged video resolutions, many video processor chips suffer from a lack of bus bandwidth and their IP cores have to wait for a longer time to get a bus grant. In multimedia data such as images and video, the adjacent data signals very often have little or no difference between them. Taking advantage of this point, this paper develops a simple bus data compression method to improve the chip performance and presents its hardware implementation. The method is applied to a Video Codec - 1 (VC-1) decoder chip and reduces the processing time of one macro-block by 13.6% and 10.3% for SD and HD videos, respectively

컨테이너 터미널 동적 운송 환경에서의 실시간 차량 운행 계획 (A Vehicle Dispatching for Dynamic Freight Transportation in Container Terminals)

  • 구평회;이운식;고시근
    • 한국경영과학회지
    • /
    • 제30권3호
    • /
    • pp.67-80
    • /
    • 2005
  • This paper deals with a container terminal where containers are discharged by quay cranes from a ship and transported by a fleet of vehicles to the terminal yard. Since container terminals are fully utilized in general, It is important to increase terminal throughput by discharging the containers out of the ship without any delay, At the operational level, it should be decided which vehicle transports which container. The vehicle dispatching decision should be carefully made since the container discharging time increases when the quay cranes wait idle for the vehicles. This paper presents vehicle dispatching heuristics with the objective of minimizing the total container discharging time. The heuristics are based on a network flow model and a look-ahead concept. Through some experiments, the performance of the dispatching methods is evaluated.

국내 외식기업의 브랜드 강화전략 (Brand Intensive Strategy of Foodservice Operations in Korea)

  • 류경민
    • 한국조리학회지
    • /
    • 제8권2호
    • /
    • pp.133-151
    • /
    • 2002
  • It is not the time when foodservice operations in Korea envy worldwide foodservice operations. For our foodservice operations to survive unlimited competition we do not wait for strong brand to be made, but make a worldwide brand through systematic tactics and strategy. To be a worldwide first-class foodservice operation we have to make first-class food products and a first-class brand accordingly. Brand has a power to lighten the future of a company and is in the limelight as a being to be attracted an attention from an invisible being. Brand is considered as a means to all the foodservice operations which invests enormous fund and time, and is appeared as a powerful weapon. It is not too much to say that 21st century is a marketing era centering on a brand. But this brand may be changed its property by various environment and changes. On the other hand it may be disappeared. Therefore more attention must be paid continuously about strategic actions to manage the brand. Now all companies can't promise to succeed without a powerful brand. The fact is that a worldwide brand to be made and developed is necessary. Also If not to do so it is very difficult to survive permanently.

  • PDF