• Title/Summary/Keyword: Queue

Search Result 1,258, Processing Time 0.028 seconds

Development of Business and Performance Record Standard Template for Rail Infrastructure BIM Performance Management (철도인프라 BIM 성과관리를 위한 업무 및 성과기록 표준 템플릿 개발)

  • Shin, Min-Ho;Kim, Hwan-Yong;Choi, Young-Woo;Han, Sang-Cheon
    • Journal of KIBIM
    • /
    • v.10 no.4
    • /
    • pp.50-59
    • /
    • 2020
  • Recently, the government has actively promoted the introduction of BIM at the national level to improve the efficiency and productivity of the construction industry, and private interest in the application of BIM has also increased. However, despite the large amount of references and information, not much research has been done in quantitative ways to accurately measure the performance of BIM projects. The purpose of this study is to review performance measurement cases using ROI, investment effect analysis, and queue model analysis using domestic and overseas BIM guideline research and to present standard templates that can quantitatively measure BIM performance records according to domestic conditions based on this. Performance measurement trends and cases according to the application of BIM were analyzed, and nine quantification elements were derived from this, and based on this, a performance measurement data collection template at the BIM life cycle stage was prepared. Detailed items and contents were prepared for the nine quantification elements, and the final template consisted of a total of 43 questions, divided into the entire stage (15), the beginning (8), the middle (8), and the latter (12) areas. It is expected that by using the standard template of railway BIM performance records developed in this study, the BIM design stage will be diagnosed and the deficiencies will be supplemented, which will be the basic data for measuring actual quantitative performance in all life cycle performance of future BIM projects.

An Optimal Container Deployment Policy in Fog Computing Environments (Fog Computing 환경에서의 최적화된 컨테이너 배포 정책)

  • Jin, Sunggeun;Chun, In-Geol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.26 no.3
    • /
    • pp.1-7
    • /
    • 2021
  • Appropriate containers are deployed to cope with new request arrivals at Fog Computing (FC) hosts. In the case, we can consider two scenarios: (1) the requests may be queued until sufficient resources are prepared for the container deployments; (2) FC hosts may transfer arrived service requests to nearby FC hosts when they cannot accommodate new container deployments due to their limited or insufficient resources. Herein, for more employed neighboring FC hosts, arrived service requests may experience shorter waiting time in container deployment queue of each FC host. In contrast, they may take longer transfer time to pass through increased number of FC hosts. For this reason, there exists a trade-off relationship in the container deployment time depending on the number of employed FC hosts accommodating service request arrivals. Consequently, we numerically analyze the trade-off relationship to employ optimal number of neighboring FC hosts.

Thread Block Scheduling for Multi-Workload Environments in GPGPU (다중 워크로드 환경을 위한 GPGPU 스레드 블록 스케줄링)

  • Park, Soyeon;Cho, Kyung-Woon;Bahn, Hyokyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.2
    • /
    • pp.71-76
    • /
    • 2022
  • Round-robin is widely used for the scheduling of large-scale parallel workloads in the computing units of GPGPU. Round-robin is easy to implement by sequentially allocating tasks to each computing unit, but the load balance between computing units is not well achieved in multi-workload environments like cloud. In this paper, we propose a new thread block scheduling policy to resolve this situation. The proposed policy manages thread blocks generated by various GPGPU workloads with multiple queues based on their computation loads and tries to maximize the resource utilization of each computing unit by selecting a thread block from the queue that can maximally utilize the remaining resources, thereby inducing load balance between computing units. Through simulation experiments under various load environments, we show that the proposed policy improves the GPGPU performance by 24.8% on average compared to Round-robin.

Adaptive Control Scheme of Air Tanker Ground Waiting Time Based on a Multi-Server Queuing Model (다중서버 큐잉 모델을 이용한 공중급유기 지상 대기시간 적응적 제어 기법)

  • Sohn, Yong-Sik;Chung, Jong-Moon
    • Journal of Internet Computing and Services
    • /
    • v.23 no.5
    • /
    • pp.33-46
    • /
    • 2022
  • This paper, in order to minimize the ground waiting time of an Air tanker, the queuing theory, that is, a queue that calculates the waiting time under single-server and multi-server situations, was used in the study. Since the national budget and resources are limited, the unlimited increase of the logistics support service team is limited. Therefore, the number of logistic support service teams that can adaptively control the ground waiting time according to the wartime preparation stage or war environment was calculated. The results of this study provide a stipulated standard for calculating the optimal number of air tanker logistic support service teams of the Air Force, providing a basis for the logistical commander to assign logistic support service teams to each stage from peacetime to wartime.

QLGR: A Q-learning-based Geographic FANET Routing Algorithm Based on Multi-agent Reinforcement Learning

  • Qiu, Xiulin;Xie, Yongsheng;Wang, Yinyin;Ye, Lei;Yang, Yuwang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.4244-4274
    • /
    • 2021
  • The utilization of UAVs in various fields has led to the development of flying ad hoc network (FANET) technology. In a network environment with highly dynamic topology and frequent link changes, the traditional routing technology of FANET cannot satisfy the new communication demands. Traditional routing algorithm, based on geographic location, can "fall" into a routing hole. In view of this problem, we propose a geolocation routing protocol based on multi-agent reinforcement learning, which decreases the packet loss rate and routing cost of the routing protocol. The protocol views each node as an intelligent agent and evaluates the value of its neighbor nodes through the local information. In the value function, nodes consider information such as link quality, residual energy and queue length, which reduces the possibility of a routing hole. The protocol uses global rewards to enable individual nodes to collaborate in transmitting data. The performance of the protocol is experimentally analyzed for UAVs under extreme conditions such as topology changes and energy constraints. Simulation results show that our proposed QLGR-S protocol has advantages in performance parameters such as throughput, end-to-end delay, and energy consumption compared with the traditional GPSR protocol. QLGR-S provides more reliable connectivity for UAV networking technology, safeguards the communication requirements between UAVs, and further promotes the development of UAV technology.

Energy-Efficient MEC Offloading Decision Algorithm in Industrial IoT Environments (산업용 IoT 환경에서 MEC 기반의 에너지 효율적인 오프로딩 결정 알고리즘)

  • Koo, Seolwon;Lim, YuJin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.11
    • /
    • pp.291-296
    • /
    • 2021
  • The development of the Internet of Things(IoT) requires large computational resources for tasks from numerous devices. Mobile Edge Computing(MEC) has attracted a lot of attention in the IoT environment because it provides computational resources geographically close to the devices. Task offloading to MEC servers is efficient for devices with limited battery life and computational capability. In this paper, we assumed an industrial IoT environment requiring high reliability. The complexity of optimization problem in industrial IoT environment with many devices and multiple MEC servers is very high. To solve this problem, the problem is divided into two. After selecting the MEC server considering the queue status of the MEC server, we propose an offloading decision algorithm that optimizes reliability and energy consumption using genetic algorithm. Through experiments, we analyze the performance of the proposed algorithm in terms of energy consumption and reliability.

Development of a distributed high-speed data acquisition and monitoring system based on a special data packet format for HUST RF negative ion source

  • Li, Dong;Yin, Ling;Wang, Sai;Zuo, Chen;Chen, Dezhi
    • Nuclear Engineering and Technology
    • /
    • v.54 no.10
    • /
    • pp.3587-3594
    • /
    • 2022
  • A distributed high-speed data acquisition and monitoring system for the RF negative ion source at Huazhong University of Science and Technology (HUST) is developed, which consists of data acquisition, data forwarding and data processing. Firstly, the data acquisition modules sample physical signals at high speed and upload the sampling data with corresponding absolute-time labels over UDP, which builds the time correlation among different signals. And a special data packet format is proposed for the data upload, which is convenient for packing or parsing a fixed-length packet, especially when the span of the time labels in a packet crosses an absolute second. The data forwarding modules then receive the UDP messages and distribute their data packets to the real-time display module and the data storage modules by PUB/SUB-pattern message queue of ZeroMQ. As for the data storage, a scheme combining the file server and MySQL database is adopted to increase the storage rate and facilitate the data query. The test results show that the loss rate of the data packets is within the range of 0-5% and the storage rate is higher than 20 Mbps, both acceptable for the HUST RF negative ion source.

A Bypass Scheme for INVITE Messages With Priority in SIP Proxies (SIP 프록시에서 우선순위를 가지는 INVITE 메시지의 우회 방법)

  • Kwon, Oh-Jun;Jang, Hee-Suk;Lee, Jong-Min
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.51-58
    • /
    • 2010
  • SIP is a flexible and extensible call setup protocol that may be combined with other protocols used in the Internet to make various services like voice communication. Voice communication can be classified into normal calls used for communication between common users and emergency calls for 112, 119 and other services through public safety networks. It is required to research to process effectively these normal calls and emergency calls through public networks such as the Internet. In this paper, we propose a bypass scheme for emergency calls by giving priority to INVITE messages for them and processing them with priority in the SIP proxy queue. We perform simulation studies using the network simulator ns-2 for the performance evaluation. Simulation results show that the proposed scheme processes emergency calls faster than normal calls and thus it is expected to make a special purpose network like the national disaster network efficiently by using the existing Internet.

A Study on the Lightweight Encryption Method for Secure MQTT Communication (안전한 MQTT 통신을 위한 경량 암호화 방법에 관한 연구)

  • Jeon, Yu-ran;Joo, Soyoung;Lee, Il-Gu
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.82-84
    • /
    • 2022
  • In recent years, research has been actively conducted to solve overhead problems caused by the increase in the number of IoT devices. MQTT, one of the IoT lightweight protocols for resolving performance degradation in IoT environments, is standardized to enable efficient operation in many-to-many communication environments, but there is a security vulnerability as it does not provide encryption by default. Although TLS communication technology can be applied to solve these problems, it is difficult to meet IoT's lightweight power-saving requirements. This paper introduces the latest MQTT communication encryption trends and analyzes IoT applicability by comparing TLS encryption and payload encryption methods.

  • PDF

A Study of Classification Analysis about Traffic Conditions Using Factor Analysis and Cluster Analysis (요인분석 및 군집분석을 활용한 교통상황 유형 분류분석)

  • Su-hwan Jeong;Kyeung-hee Han;Jaehyun (Jason) So;Choul-ki Lee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.22 no.1
    • /
    • pp.65-80
    • /
    • 2023
  • In this study, a classification analysis was performed based on the type of traffic situation. The purpose was to derive the major variable factors that could represent the traffic situation. The TTI(Travel Time Index) was used as a criterion for determining traffic conditions, and analysis was performed using data generally detected by the Vehicle Detecting System(VDS). First, the major factors influencing the traffic situation were selected through factor analysis, and traffic conditions were clustered through a cluster analysis of the major factors. After that, variance analysis for each cluster was performed based on the TTI, and similar clusters were merged to categorize the type of traffic situation. The analysis derived, the maximum queue length and occupancy as major factors that could represent the traffic situation. Through this study, it is expected that efficient management of traffic congestion would be possible by just concentrating on the main variable factors that affect the traffic situation.