• Title/Summary/Keyword: user-level scheduling

Search Result 51, Processing Time 0.029 seconds

CReMeS: A CORBA COmpliant Reflective Memory based Real-time Communication Service

  • Chung, Sun-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.10B
    • /
    • pp.1675-1689
    • /
    • 2000
  • We present CReMeS a CORBA-compliant design and implementation of a new real-time communication service. It provides for efficient predictable and scalable communication between information producers and consumers. The CReMeS architecture is based on MidART's Real-Time Channel-based Reflective Memory (RT-CRM) abstraction. This architecture supports the separation of QoS specification between producer and consumer of data and employs a user-level scheduling scheme for communicating real-time tasks. These help us achieve end-to-end predictability and allows our service to scale. The CReMeS architecture provides a CORBA interface to applications and demands no changes to the ORB layer and the language mapping layer. Thus it can run on non real-time Off-The-Shelf ORBs enables applications on these ORBs to have scalable and end-to-end predictable asynchronous communication facility. In addition an application designer can select whether to use an out-of-band channel or the ORB GIOP/IIOP for data communication. This permits a trade-off between performance predictability and reliability. Experimental results demonstrate that our architecture can achieve better performance and predictability than a real-time implementation of the CORBA Even Service when the out-of-band channel is employed for data communication it delivers better predictability with comparable performance when the ORB GIOP/IIOP is used.

  • PDF

Research on Hot-Threshold based dynamic resource management in the cloud

  • Gun-Woo Kim;Seok-Jae Moon;Byung-Joon Park
    • International Journal of Advanced Culture Technology
    • /
    • v.12 no.3
    • /
    • pp.471-479
    • /
    • 2024
  • Recent advancements in cloud computing have significantly increased its importance across various sectors. As sensors, devices, and customer demands have become more diverse, workloads have become increasingly variable and difficult to predict. Cloud providers, connected to multiple physical servers to support a range of applications, often over-provision resources to handle peak workloads. This approach results in inconsistent services, imbalanced energy usage, waste, and potential violations of service level agreements. In this paper, we propose a novel engine equipped with a scheduler based on the Hot-Threshold concept, aimed at optimizing resource usage and improving energy efficiency in cloud environments. We developed this engine to employ both proactive and reactive methods. The proactive method leverages workload estimate-based provisioning, while the reactive Hot-Cold Scheduler consists of a Predictor, Solver, and Processor, which together suggest an intelligent migration flow. We demonstrate that our approach effectively addresses existing challenges in terms of cost and energy consumption. By intelligently managing resources based on past user statistics, we provide significant improvements in both energy efficiency and service consistency.

A Scheduling Algorithm using The Priority of Broker for Improving The Performance of Semantic Web-based Visual Media Retrieval Framework (분산시각 미디어 검색 프레임워크의 성능향상을 위한 브로커 서버 우선순위를 이용한 라운드 로빈 스케줄링 기법)

  • Shim, Jun-Yong;Won, Jae-Hoon;Kim, Se-Chang;Kim, Jung-Sun
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.1
    • /
    • pp.22-32
    • /
    • 2008
  • To overcome the weakness of the image retrieval system using the existing Ontology and the distributed image based on the database having a simple structure, HERMES was suggested to ensure the self-control of various image suppliers and support the image retrieval based on semantic, the mentioned framework could not solve the problems which are not considered the deterioration in the capacity and scalability when many users connect to broker server simultaneously. In this paper the tables are written which in the case numerous users connect at the same time to the supply analogous level of services without the deterioration in the capacity installs Broker servers and then measures the performance time of each inner Broker Component through Monitoring System and saved and decides the ranking in saved data. As many Query performances are dispersed into several Servers User inputted from the users Interface with reference to Broker Ranking Table, Load Balancing system improving reliability in capacity is proposed. Through the experiment, the scheduling technique has proved that this schedule is faster than existing techniques.

Design and Implementation of Preemptive EDF Scheduling Algorithm in TinyOS (TinyOS에서의 선점적 EDF 스케줄링 알고리즘 설계 및 구현)

  • Yoo, Jong-Sun;Kim, Byung-Kon;Choi, Byoung-Kyu;Heu, Shin
    • The KIPS Transactions:PartA
    • /
    • v.18A no.6
    • /
    • pp.255-264
    • /
    • 2011
  • A sensor network is a special network that makes physical data sensed by sensor nodes and manages the data. The sensor network is a technology that can apply to many parts of field. It is very important to transmit the data to a user at real-time. The core of the sensor network is a sensor node and small operating system that works in the node. TinyOS developed by UC Berkeley is a sensor network operating system that used many parts of field. It is event-driven and component-based operating system. Basically, it uses non-preemptive scheduler. If an urgent task needs to be executed right away while another task is running, the urgent one must wait until another one is finished. Because of that property, it is hard to guarantee real-time requirement in TinyOS. According to recent study, Priority Level Scheduler, which can let one task preempt another task, was proposed in order to have fast response in TinyOS. It has restrictively 5 priorities, so a higher priority task can preempt a lower priority task. Therefore, this paper suggests Preemptive EDF(Earliest Deadline First) Scheduler that guarantees a real-time requirement and reduces average respond time of user tasks in TinyOS.

A Resource Information Model for High Performance GRID Environemnts (고성능 그리드 환경을 위한 자원정보모델에 관한 연구)

  • Kim Hie-Cheol;Lee Kang-Woo;Lee Yong-Doo;Cho Sae-Hong
    • Journal of Digital Contents Society
    • /
    • v.2 no.2
    • /
    • pp.167-178
    • /
    • 2001
  • For high performance Grid environments, an effective GIS(Grid Information System) should be adopted. In the design of GIS architecture, its grid resource information model provides a key basis. This paper presents our study on the exploration of a high performance grid resource information model. According the exploration, we identified the followings. The resource information model should clearly address the issues of relation descriptions as well as resource descriptions, issues related to scheduling support, the issue of decoupling the expression model of resource information from data repository models, and finally the issue of decoupling user-level resource descriptions from system-level resource descriptions. Based on the proposed conceptual organization of resource information models, analysis result for the existing resource information models are presented.

  • PDF

Performance Evaluation of Simple-Relay Aided Resource Allocation and Throughput Guarantee Scheduler in IEEE 802.16 TDD-OFDMA Downlink (IEEE 802.16 TDD-OFDMA 하향링크에서의 단순 릴레이 협력 자원 관리와 수율 보장 스케줄러를 이용한 서비스 커버리지 및 섹터 수율에 관한 연구)

  • Ki, Young-Min;Byun, Dae-Wook;Kim, Dong-Ku;Son, Haeng-Seon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.11 s.353
    • /
    • pp.85-94
    • /
    • 2006
  • Simple-relay aided resource allocation (SRARA) schemes are incorporated with throughput guarantee scheduling (TGS) in IEEE 802.16 type TDD-OFDMA downlink to enhance service coverage, where the amount of resources at each relay is limited due to either its available power which is much smaller than base station (BS) power or the required overhead The performance of SRARA schemes is evaluated with both proportional fair (PF) and TGS schedulers at 64 kbps and 128 kbps user throughput requirements. For SRARA with RSs of relatively lower power, a scheme putting total power into only one subchannel shows larger coverage than when both subchnnels are used in a manner of equal power allocation, while the RS with evenly power-allocated two subchannels could provide larger coverage gain for a relatively higher power. In a lower target (64kbps), more improvement comes from relay scheme rather than scheduler design. For a relatively higher level (128 kbps), it comes from scheduler design rather than relay.

Coverage Enhancement in TDD-OFDMA Downlink by using Simple-Relays with Resource Allocation and Throughput Guarantee Scheduler (TDD-OFDMA 하향링크에서의 단순 릴레이를 이용한 자원 할당과 수율 보장 스케줄러를 사용한 서비스 커버리지 향상에 관한 연구)

  • Byun, Dae-Wook;Ki, Young-Min;Kim, Dong-Ku
    • Journal of Advanced Navigation Technology
    • /
    • v.10 no.3
    • /
    • pp.275-281
    • /
    • 2006
  • Simple-relay aided resource allocation (SRARA) schemes are incorporated with throughput guarantee scheduling (TGS) in IEEE 802.16 type time division duplex - orthogonal frequency division multiple access (TDD-OFDMA) downlink in order to enhance service coverage, where the amount of resources for relaying at each relay is limited due to either its available power which is much smaller than base station (BS) power or the overhead required for exchanging feedback information. The performance of SRARA schemes is evaluated with schedulers such as proportional fair (PF) and TGS at 64kbps and 128kbps user throughput requirements when total MS power is set to 500mW or 1 W. For 64kbps throughput requirement level, more improvement comes from relay than scheduler design. For 128kbps case, it comse from scheduler design than relay due to the fact that simple relay can't help using strictly limited amount of resources for relaying function.

  • PDF

An Efficient Algorithm of Network Bandwidth Allocations for Multimedia Services (멀티미디어 서비스를 위한 효율적인 대역폭 할당)

  • 김정택;고인선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1112-1123
    • /
    • 2002
  • Providing a multimedia service requires efficient network bandwidth allocation scheduling. Typically, transmission of information with bursty characteristics, such as a video data stream, utilizes some type of smoothing technique that reduces the transmission rate fluctuation. While capable of a drastic reduction in the peak transmission rate, even the optimum smoothing algorithm proposed to date, however, is rather inadequate for multi-stream applications that share network bandwidth since such an algorithm has been designed and applied toward handling each independent stream. In this paper, we proposed an efficient bandwidth allocation algorithm that addresses these shortcomings. The proposed bandwidth allocation algorithm is divided into two steps, a static bandwidth allocation and a dynamic bandwidth allocation. In the former case, the peak rate reduction is achieved by maintaining the accumulated data in the user buffer at a high level, whereas the concept of real demand factor is employed to meet the needs of multi-stream bandwidth allocation in the latter case, Finally, the proposed algorithm's performance was verified with ExSpect 6.41, a Petri net simulation tool.

User-Level Threads for the ARX Real-Time Operating System (ARX 실시간 운영체계를 위한 사용자 레벨 쓰레드)

  • Seo, Yang-Min;Park, Jung-Keun;Hong, Seong-Soo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.65-67
    • /
    • 1998
  • 내장 실시간 시스템이 높은 우선순위의 비동기적 이벤트를 적시에 처리하면서 필수적으로 적은 비용의 선점 다중쓰레드를 지원해야한다. 사용자 레벨 쓰레드는 커널 레벨 쓰레드 보다 적은 비용의 유연한 추상적 기법들을 제공하지만, 기존의 실시간 시스템에서는 스케줄링과 시그날(signal) 처리가 단순하다는 이류로 커널 레벨 쓰레드가 선호 되어왔다. 본 논문에서는 내장 실시간 시스템에 적합한 새로운 사용자 레벨 다중 쓰레드 방식을 제안한다. 이 기법은 가상 쓰레드(virtual threads)와 개선된 스케줄링 이벤트 업콜(scheduling event upcall) 메카니즘을 기반으로 한다. 가상 쓰레드는 사용자 레벨 쓰레드에게 커널 레벨의 실행 환경을 제공할 수 있도록 사용자 레벨 쓰레드를 커널 레벨로 형상화한 것이다. 이 쓰레드는 필요에 의해 잠시동안 사용자 레벨 쓰레드에 묶이는 소동적인 존재이다. 스케줄링 이벤트 업콜 메카니즘은 쓰레드 블록킹과 타이머 만기와 같은 커널 이벤트를 유저 프로세서에게 전달할 수 있게 한다. 본 논문의 개선된 업콜 방식은 scheduler activation과 시그날과 같은 전통적인 업콜 구조에서 예측하기 힘든 요소들을 배제했다. 순간적인 시스템의 과부하 상황에서도 이벤트를 놓치지 않으면서 커널과 유저 프로세서의 비싼 동기화 작업들을 피할 수 있도록 하는 잠금(lock)이 필요 없는 이벤트 큐를 상용한다. 본 기법은 서울대학교 실시간 운영체계 실험실에서 구현한 ARX위에 완벽하게 구현되었다. ARX 사용자 레벨 쓰레드가 사용자 레벨 쓰레드의 장점을 손상하지 않으면서 솔라리스와 윈도즈98과 같은 상용 운영체제의 커널 쓰레드보다 성능이 우수함을 실험적 비교에 의해서 입증한다.분에서 uronic acid를 분리동정하였을 때 점미는 0.90%, 백미는 0.66%, 흑미는 1.8%로서 흑미에서 uronic acid 함량이 두 배 이상으로 나타났다. 흑미의 uronic acid 함량이 가장 많이 용출된 분획은 sodium hydroxide 부분으로서 hemicellulose구조가 polyuronic acid의 형태인 것으로 사료된다. 추출획분의 구성단당은 여러 곡물연구의 보고와 유사하게 glucose, arabinose, xylose 함량이 대체로 높게 나타났다. 점미가 수가용성분에서 goucose대비 용출함량이 고르게 나타나는 경향을 보였고 흑미는 알칼리가용분에서 glucose가 상당량(0.68%) 포함되고 있음을 보여주었고 arabinose(0.68%), xylose(0.05%)도 다른 종류에 비해서 다량 함유한 것으로 나타났다. 흑미는 총식이섬유 함량이 높고 pectic substances, hemicellulose, uronic acid 함량이 높아서 콜레스테롤 저하 등의 효과가 기대되며 고섬유식품으로서 조리 특성 연구가 필요한 것으로 사료된다.리하였다. 얻어진 소견(所見)은 다음과 같았다. 1. 모년령(母年齡), 임신회수(姙娠回數), 임신기간(姙娠其間), 출산시체중등(出産時體重等)의 제요인(諸要因)은 주산기사망(周産基死亡)에 대(對)하여 통계적(統計的)으로 유의(有意)한 영향을 미치고 있어 $25{\sim}29$세(歲)의 연령군에서, 2번째 임신과 2번째의 출산에서 그리고 만삭의 임신 기간에, 출산시체중(出産時體重) $3.50{\sim}3.99kg$사이의 아이에서 그 주산기사망률(周産基死亡率)이 각각 가장 낮았다. 2. 사산(死産)과 초생

  • PDF

Using the METHONTOLOGY Approach to a Graduation Screen Ontology Development: An Experiential Investigation of the METHONTOLOGY Framework

  • Park, Jin-Soo;Sung, Ki-Moon;Moon, Se-Won
    • Asia pacific journal of information systems
    • /
    • v.20 no.2
    • /
    • pp.125-155
    • /
    • 2010
  • Ontologies have been adopted in various business and scientific communities as a key component of the Semantic Web. Despite the increasing importance of ontologies, ontology developers still perceive construction tasks as a challenge. A clearly defined and well-structured methodology can reduce the time required to develop an ontology and increase the probability of success of a project. However, no reliable knowledge-engineering methodology for ontology development currently exists; every methodology has been tailored toward the development of a particular ontology. In this study, we developed a Graduation Screen Ontology (GSO). The graduation screen domain was chosen for the several reasons. First, the graduation screen process is a complicated task requiring a complex reasoning process. Second, GSO may be reused for other universities because the graduation screen process is similar for most universities. Finally, GSO can be built within a given period because the size of the selected domain is reasonable. No standard ontology development methodology exists; thus, one of the existing ontology development methodologies had to be chosen. The most important considerations for selecting the ontology development methodology of GSO included whether it can be applied to a new domain; whether it covers a broader set of development tasks; and whether it gives sufficient explanation of each development task. We evaluated various ontology development methodologies based on the evaluation framework proposed by G$\acute{o}$mez-P$\acute{e}$rez et al. We concluded that METHONTOLOGY was the most applicable to the building of GSO for this study. METHONTOLOGY was derived from the experience of developing Chemical Ontology at the Polytechnic University of Madrid by Fern$\acute{a}$ndez-L$\acute{o}$pez et al. and is regarded as the most mature ontology development methodology. METHONTOLOGY describes a very detailed approach for building an ontology under a centralized development environment at the conceptual level. This methodology consists of three broad processes, with each process containing specific sub-processes: management (scheduling, control, and quality assurance); development (specification, conceptualization, formalization, implementation, and maintenance); and support process (knowledge acquisition, evaluation, documentation, configuration management, and integration). An ontology development language and ontology development tool for GSO construction also had to be selected. We adopted OWL-DL as the ontology development language. OWL was selected because of its computational quality of consistency in checking and classification, which is crucial in developing coherent and useful ontological models for very complex domains. In addition, Protege-OWL was chosen for an ontology development tool because it is supported by METHONTOLOGY and is widely used because of its platform-independent characteristics. Based on the GSO development experience of the researchers, some issues relating to the METHONTOLOGY, OWL-DL, and Prot$\acute{e}$g$\acute{e}$-OWL were identified. We focused on presenting drawbacks of METHONTOLOGY and discussing how each weakness could be addressed. First, METHONTOLOGY insists that domain experts who do not have ontology construction experience can easily build ontologies. However, it is still difficult for these domain experts to develop a sophisticated ontology, especially if they have insufficient background knowledge related to the ontology. Second, METHONTOLOGY does not include a development stage called the "feasibility study." This pre-development stage helps developers ensure not only that a planned ontology is necessary and sufficiently valuable to begin an ontology building project, but also to determine whether the project will be successful. Third, METHONTOLOGY excludes an explanation on the use and integration of existing ontologies. If an additional stage for considering reuse is introduced, developers might share benefits of reuse. Fourth, METHONTOLOGY fails to address the importance of collaboration. This methodology needs to explain the allocation of specific tasks to different developer groups, and how to combine these tasks once specific given jobs are completed. Fifth, METHONTOLOGY fails to suggest the methods and techniques applied in the conceptualization stage sufficiently. Introducing methods of concept extraction from multiple informal sources or methods of identifying relations may enhance the quality of ontologies. Sixth, METHONTOLOGY does not provide an evaluation process to confirm whether WebODE perfectly transforms a conceptual ontology into a formal ontology. It also does not guarantee whether the outcomes of the conceptualization stage are completely reflected in the implementation stage. Seventh, METHONTOLOGY needs to add criteria for user evaluation of the actual use of the constructed ontology under user environments. Eighth, although METHONTOLOGY allows continual knowledge acquisition while working on the ontology development process, consistent updates can be difficult for developers. Ninth, METHONTOLOGY demands that developers complete various documents during the conceptualization stage; thus, it can be considered a heavy methodology. Adopting an agile methodology will result in reinforcing active communication among developers and reducing the burden of documentation completion. Finally, this study concludes with contributions and practical implications. No previous research has addressed issues related to METHONTOLOGY from empirical experiences; this study is an initial attempt. In addition, several lessons learned from the development experience are discussed. This study also affords some insights for ontology methodology researchers who want to design a more advanced ontology development methodology.