• Title/Summary/Keyword: dispatcher

Search Result 94, Processing Time 0.025 seconds

Efficient Connection Scheduling Technique for Hosting Internet Services on a Cluster of Servers (서버 클러스터에서의 인터넷 서비스를 위한 효율적인 연결 스케줄링 기법)

  • 최재웅;김성천
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.7_8
    • /
    • pp.352-358
    • /
    • 2003
  • A cluster of servers is the most promising solution to provide highly scalable and highly available network services with low implementation cost. One of popular solutions is using dispatcher as a request distributor. However this solution has the problem that is can be the bottleneck or single-point of failure point of itself. ONE-IP, the previous work, solves this serious problem by using broadcast message for distributing the request packet in LAN. Using simple scheduling technique, in addition, the overhead due to dispatching the request becomes minimal. However, as ONE-IP using very simple static scheduling algorithm, it would spread the request among servers unevenly and downgrades the cluster performance consequently. In this paper, we propose an improved TCP connection scheduling technique solving this unbalanced distributing problem. Using Round-Robin(RR) scheduling instead of hashing clients IP address, proposed technique can more evenly distribute incoming service requests among the servers. Experiments show average 3.8% improved performance in throughput compared to original ONE-IP technique.

Impact of nonphysician, technology-guided alert level selection on rates of appropriate trauma triage in the United States: a before and after study

  • Megan E. Harrigan;Pamela A. Boremski;Bryan R. Collier;Allison N. Tegge;Jacob R. Gillen
    • Journal of Trauma and Injury
    • /
    • v.36 no.3
    • /
    • pp.231-241
    • /
    • 2023
  • Purpose: Overtriage and undertriage rates are critical metrics in trauma, influenced by both trauma team activation (TTA) criteria and compliance with these criteria. Analysis of undertriaged patients at a level I trauma center revealed suboptimal compliance with existing criteria. This study assessed triage patterns after implementing compliance-focused process interventions. Methods: A physician-driven, free-text alert system was modified to a nonphysician, hospital dispatcher-guided system. The latter employed dropdown menus to maximize compliance with criteria. The preintervention period included patients who presented between May 12, 2020, and December 31, 2020. The postintervention period incorporated patients who presented from May 12, 2021, through December 31, 2021. We evaluated appropriate triage, overtriage, and undertriage using the Standardized Trauma Assessment Tool. Statistical analyses were conducted with an α level of 0.05. Results: The new system was associated with improved compliance with existing TTA criteria (from 70.3% to 79.3%, P=0.023) and decreased undertriage (from 6.0% to 3.2%, P=0.002) at the expense of increasing overtriage (from 46.6% to 57.4%, P<0.001), ultimately decreasing the appropriate triage rate (from 78.4% to 74.6%, P=0.007). Conclusions: This study assessed a workflow change designed to improve compliance with TTA criteria. Improved compliance decreased undertriage to below the target threshold of 5%, albeit at the expense of increased overtriage. The decrease in appropriate triage despite compliance improvements suggests that the current criteria at this institution are not adequately tailored to optimally balance the minimization of undertriage and overtriage. This finding underscores the importance of improved compliance in evaluating the efficacy of TTA criteria.

Study on Vehicle Routing Problem with Minimum Delivery Completion Time (특송소화물 배송완료시간 최소화를 위한 차량경로문제 연구)

  • Lee, Sang-Heon
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.7 s.78
    • /
    • pp.107-117
    • /
    • 2004
  • The growing demand for customer-response, made-to-order manufacturing and satisfactory delivery are stimulating the importance of commercial fleet management problem. Moreover, the rapid transformation to the customer-oriented multi-frequency, relatively small fleet, such as home delivery and Perishable goods, requiring prompt delivery and advanced real-time operation of vehicle fleets. In this paper we consider the vehicle routing problem(VRP) to minimize delivery completion time which is equal to the time that last customer wait for the vehicle in fleet operation. The mathematical formulation is different from those for the classical VRP which is minimizing cost/distance/time by running vehicles in manager's point of view. The key aspect of this model is not considering the return time from the last customer to depot in every vehicle path. Thereby, the vehicle dispatcher can afford to dynamically respond to customer demand and vehicle availability. The customer's position concerned with minimizing waiting time that may be applied for the delivery of product required freshness or delivery time. Extensive experiments are carried out to compare the performance of minimizing delivery completion time by using the ILOG Solver which has the advantage of solving quickly an interim solution very near an optimal solution. The experimental results show that the suggested model can easily find near optimal solution in a reasonable computational time under the various combination of customers and vehicles.

A New Web Cluster Scheme for Load Balancing among Internet Servers (인터넷 환경에서 서버간 부하 분산을 위한 새로운 웹 클러스터 기법)

  • Kim, Seung-Young;Lee, Seung-Ho
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.115-122
    • /
    • 2002
  • This paper presents a new web cluster scheme based on dispatcher which does not depend on operating system for server and can examine server's status interactively. Two principal functions are proposed for new web cluster technique. The one is self-controlled load distribution and the other is transaction fail-safe. Self-controlled load distribution function checks response time and status of servers periodically, then it decides where the traffic goes to guarantee rapid response for every query. Transaction fail-safe function can recover lost queries including broken transaction immediately from server errors. Proposed new web cluster scheme is implemented by C language on Unix operating system and compared with legacy web cluster products. On the comparison with broadcast based web cluster, proposed new web cluster results higher performance as more traffic comes. And on the comparison with a round-robin DNS based web cluster, it results similar performance at the case of traffic processing. But when the situation of one server crashed, proposed web cluster processed traffics more reliably without lost queries. So, new web cluster scheme Proposed on this dissertation can give alternative plan about highly increasing traffics and server load due to heavy traffics to build more reliable and utilized services.