• Title/Summary/Keyword: Overhead worker

Search Result 6, Processing Time 0.02 seconds

A hybrid prioritized worker model for efficiency of shared resources in the real-time system (실시간 시스템에서 공유자원의 효율적 사용을 위한 혼합형 우선순위 작업자 모델)

  • Park, Hong-Jin;Chun, Kyung-Ah;Kim, Chang-Min
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.12
    • /
    • pp.3652-3661
    • /
    • 1999
  • To support multimedia applications such as a multimedia communication systems and multimedia broadcasting, an operating system need to predict their timing-constraints. So, In this real-time systems, we must solve the priority inversion problem that may make the behavior of unpredictable systems and need a real-time server model that provides a better preemptability and minimizes a system overhead. In current real-time systems, the single thread server model, the worker model and the dynamic server model are being used for synchronization but they cannot propose an effective structure for managing shared resources. In this paper, the priority inheritance protocol is used to solve the priority inversion problem and the hybrid prioritized worker model is proposed, which can provide a more effective structure and a faster response time minimizing a system overhead. The hybrid prioritized worker model is to combine the static and the dynamic prioritized worker model, and have a better performance than other models in response time which is an important factor in a real-time system.

  • PDF

Bilateral Shoulder Involvement with Mirror Image Lesion -An Arthroscopic Study in Overhead Workers (양측 견관절을 침범한 거울 병변 -머리 위의 작업을 하는 근로자 대상 관절경적 연구)

  • Moon, Young-Lae;Lee, Chul-Gab;Kim, Jong-Sik
    • Clinics in Shoulder and Elbow
    • /
    • v.9 no.1
    • /
    • pp.68-72
    • /
    • 2006
  • Purpose: To demonstrate arthroscopically the presence of bilateral shoulder "mirror lesions" due to overhead work. Materials and Methods: A cross-sectional study was performed in a historical cohort of 10 male tire plant workers who underwent MRI studies of both shoulders. Bilateral intraarticular shoulder pathology was diagnosed by magnetic resonance imaging and confirmed by arthroscopy. "Mirror lesions" were defined as similar pathology between an individual patient's two shoulders. Results: We report on ten patients who had bilateral "mirror lesions." The most common mirror lesions were tears of the rotator cuff. Most patients (7 of 10) had more than one mirror lesion in their shoulders. There were two bilateral full thickness tears involving the supraspinatus and infraspinatus, four bilateral partial thickness supraspinatus tears, six bilateral partial or upper corner lesion complete subscapularis tears, and one bilateral complete supraspinatus tear. Conclusion: Occupational overhead work with simultaneous use of both arms is associated with bilateral shoulder lesions verified by arthroscopy. By demonstrating the work-related bilateral shoulder involvement, this study suggests an etiopathogenesis for these lesions and provides rational for developing worksite prevention strategies.

Prediction-based Dynamic Thread Pool System for Massively Multi-player Online Game Server

  • Ju, Woo-Suk;Im, Choong-Jae
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.6
    • /
    • pp.876-881
    • /
    • 2009
  • Online game servers usually has been using the static thread pool system. But this system is not fit for huge online game server because the overhead is always up-and-down. Therefore, in this paper, we suggest the new algorithm for huge online game server. This algorithm is based on the prediction-based dynamic thread pool system. But it was developed for web servers and every 0.1 seconds the system prediction the needed numbers of threads and determine the thread pool size. Some experimental results show that the check time of 0.4 seconds is the best one for online game server and if the number of worker threads do not excess or lack to the given threshold then we do not predict and keep the current state. Otherwise we apply the prediction algorithm and change the number of threads. Some experimental results shows that this proposed algorithm reduce the overhead massively and make the performance of huge online game server improved in comparison to the static thread pool system.

  • PDF

A Lightweight and Privacy-Preserving Answer Collection Scheme for Mobile Crowdsourcing

  • Dai, Yingling;Weng, Jian;Yang, Anjia;Yu, Shui;Deng, Robert H.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.8
    • /
    • pp.2827-2848
    • /
    • 2021
  • Mobile Crowdsourcing (MCS) has become an emerging paradigm evolved from crowdsourcing by employing advanced features of mobile devices such as smartphones to perform more complicated, especially spatial tasks. One of the key procedures in MCS is to collect answers from mobile users (workers), which may face several security issues. First, authentication is required to ensure that answers are from authorized workers. In addition, MCS tasks are usually location-dependent, so the collected answers could disclose workers' location privacy, which may discourage workers to participate in the tasks. Finally, the overhead occurred by authentication and privacy protection should be minimized since mobile devices are resource-constrained. Considering all the above concerns, in this paper, we propose a lightweight and privacy-preserving answer collection scheme for MCS. In the proposed scheme, we achieve anonymous authentication based on traceable ring signature, which provides authentication, anonymity, as well as traceability by enabling malicious workers tracing. In order to balance user location privacy and data availability, we propose a new concept named current location privacy, which means the location of the worker cannot be disclosed to anyone until a specified time. Since the leakage of current location will seriously threaten workers' personal safety, causing such as absence or presence disclosure attacks, it is necessary to pay attention to the current location privacy of workers in MCS. We encrypt the collected answers based on timed-release encryption, ensuring the secure transmission and high availability of data, as well as preserving the current location privacy of workers. Finally, we analyze the security and performance of the proposed scheme. The experimental results show that the computation costs of a worker depend on the number of ring signature members, which indicates the flexibility for a worker to choose an appropriate size of the group under considerations of privacy and efficiency.

Development of a Diagnostic Module Based Maintenance Support Device for Fiber Optic Telecommunication Cable in Overhead Region (고소지역 작업현장에서 공중선 상태 진단 모듈 기반 정비 지원 장치 개발)

  • Kim, Hee-Chul
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.4
    • /
    • pp.469-474
    • /
    • 2014
  • Installed on telephone poles laid scrambling to monitor the status of the communication lines, and cost information can provid eadditional information tools to develop systems to support on-site monitoring. Aerial support for a maintenance monitoring module to apply an embedded system, and information processing applications manufactured. In this study, a comprehensive plan in accordance with the government's aerial maintenance work to prevent accidents spread support for the device to immediately take advantage of big cities and aerial maintenance business, Construction worker accused of bias and aims to improve efficiency of maintenance puts.

Mobile Agent Location Management Protocol for Spatial Replication-based Approach in Mobile Agent Computing Environments (이동 에이전트 컴퓨팅 환경에서 공간적 복제 기반 기법을 위한 이동 에이전트 위치관리 프로토콜)

  • Yoon, Jun-Weon;Choi, Sung-Jin;Ahn, Jin-Ho
    • The KIPS Transactions:PartA
    • /
    • v.13A no.5 s.102
    • /
    • pp.455-464
    • /
    • 2006
  • In multi-regional mobile agent computing environments, spatial replication-based approach may be used as a representative mobile agent fault-tolerance technique because it allows agent execution to make progress without blocking even in case of agent failures. However, to apply this approach to real mobile agent-based computing systems, it is essential to minimize the overhead of locating and managing mobile agents replicated on each stage. This paper presents a new mobile agent location management protocol SRLM to solve this problem. The proposed protocol allows only the primary among all the replicated workers of each stage to register with its regional server and then, significantly reduces its location updating and message delivery overheads compared with the previous protocols. Also, the protocol addresses the location management problem incurred by electing the new primary among the remaining workers at a stage in case of the primary worker's failure.