• Title/Summary/Keyword: task response time

Search Result 233, Processing Time 0.023 seconds

A Task Scheduling Strategy in Cloud Computing with Service Differentiation

  • Xue, Yuanzheng;Jin, Shunfu;Wang, Xiushuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5269-5286
    • /
    • 2018
  • Task scheduling is one of the key issues in improving system performance and optimizing resource management in cloud computing environment. In order to provide appropriate services for heterogeneous users, we propose a novel task scheduling strategy with service differentiation, in which the delay sensitive tasks are assigned to the rapid cloud with high-speed processing, whereas the fault sensitive tasks are assigned to the reliable cloud with service restoration. Considering that a user can receive service from either local SaaS (Software as a Service) servers or public IaaS (Infrastructure as a Service) cloud, we establish a hybrid queueing network based system model. With the assumption of Poisson arriving process, we analyze the system model in steady state. Moreover, we derive the performance measures in terms of average response time of the delay sensitive tasks and utilization of VMs (Virtual Machines) in reliable cloud. We provide experimental results to validate the proposed strategy and the system model. Furthermore, we investigate the Nash equilibrium behavior and the social optimization behavior of the delay sensitive tasks. Finally, we carry out an improved intelligent searching algorithm to obtain the optimal arrival rate of total tasks and present a pricing policy for the delay sensitive tasks.

Language Lateralization Using Magnetoencephalography (MEG): A Preliminary Study (뇌자도를 이용한 언어 편재화: 예비 연구)

  • Lee, Seo-Young;Kang, Eunjoo;Kim, June Sic;Lee, Sang-Kun;Kang, Hyejin;Park, Hyojin;Kim, Sung Hun;Lee, Seung Hwan;Chung, Chun Kee
    • Annals of Clinical Neurophysiology
    • /
    • v.8 no.2
    • /
    • pp.163-170
    • /
    • 2006
  • Backgrounds: MEG can measure the task-specific neurophysiologic activity with good spatial and time resolution. Language lateralization using noninvasive method has been a subject of interest in resective brain surgery. We purposed to develop a paradigm for language lateralization using MEG and validate its feasibility. Methods: Magnetic fields were obtained in 12 neurosurgical candidates and one volunteer for language tasks, with a 306 channel whole head MEG. Language tasks were word listening, reading and picture naming. We tested two word listening paradigms: semantic decision of meaning of abstract nouns, and recognition of repeated words. The subjects were instructed to silently name or read, and respond with pushing button or not. We decided language dominance according to the number of acceptable equivalent current dipoles (ECD) modeled by sequential single dipole, and the mean magnetic field strength by root mean square value, in each hemisphere. We collected clinical data including Wada test. Results: Magnetic fields evoked by word listening were generally distributed in bilateral temporoparietal areas with variable hemispheric dominance. Language tasks using visual stimuli frequently evoked magnetic field in posterior midline area, which made laterality decision difficult. Response during task resulted in more artifacts and different results depending on responding hand. Laterality decision with mean magnetic field strength was more concordant with Wada than the method with ECD number of each hemisphere. Conclusions: Word listening task without hand response is the most feasible paradigm for language lateralization using MEG. Mean magnetic field strength in each hemisphere is a proper index for hemispheric dominance.

  • PDF

Ultrafast Orientation Relaxation Dnamics in Solution (용액에서의 초고속 방향성 이완 동력학)

  • 정영붕
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 1989.02a
    • /
    • pp.55-58
    • /
    • 1989
  • The methods of recording transient phenomena with picosecond or better resolution fall into two basic categories: those in which the detector itself prossesses adequate time resolution for the task at hand, and those in which the response of the system is sampled by examining the characteristics of a second pulse ("the probe") delayed in time from the initiating pulse ("the pump") as a function of time delay between pump and probe cases. In this case the time resolution is only limited by the pump-and probe-pulse durations. As an application of this time-resolved spectroscopic technique, the ultrafast orientational relaxation phenomena of the dye molecules are currently under investigation in our laboratory. In this presentation the status of our experiment is summarized.iment is summarized.

  • PDF

Service Mobility Support Scheme in SDN-based Fog Computing Environment (SDN 기반 Fog Computing 환경에서 서비스 이동성 제공 방안)

  • Kyung, Yeun-Woong;Kim, Tae-Kook
    • Journal of Internet of Things and Convergence
    • /
    • v.6 no.3
    • /
    • pp.39-44
    • /
    • 2020
  • In this paper, we propose a SDN-based fog computing service mobility support scheme. Fog computing architecture has been attracted because it enables task offloading services to IoT(Internet of Things) devices which has limited computing and power resources. However, since static as well as mobile IoT devices are candidate service targets for the fog computing service, the efficient task offloading scheme considering the mobility should be required. Especially for the IoT services which need low-latency response, the new connection and task offloading delay with the new fog computing node after handover can occur QoS(Quality of Service) degradation. Therefore, this paper proposes an efficient service mobility support scheme which considers both task migration and flow rule pre-installations. Task migration allows for the service connectivity when the fog computing node needs to be changed. In addition, the flow rule pre-installations into the forwarding nodes along the path after handover enables to reduce the connection delay and service interruption time.

Honey Bee Based Load Balancing in Cloud Computing

  • Hashem, Walaa;Nashaat, Heba;Rizk, Rawya
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5694-5711
    • /
    • 2017
  • The technology of cloud computing is growing very quickly, thus it is required to manage the process of resource allocation. In this paper, load balancing algorithm based on honey bee behavior (LBA_HB) is proposed. Its main goal is distribute workload of multiple network links in the way that avoid underutilization and over utilization of the resources. This can be achieved by allocating the incoming task to a virtual machine (VM) which meets two conditions; number of tasks currently processing by this VM is less than number of tasks currently processing by other VMs and the deviation of this VM processing time from average processing time of all VMs is less than a threshold value. The proposed algorithm is compared with different scheduling algorithms; honey bee, ant colony, modified throttled and round robin algorithms. The results of experiments show the efficiency of the proposed algorithm in terms of execution time, response time, makespan, standard deviation of load, and degree of imbalance.

Real-time Task Aware Memory Allocation Techniques for Heterogeneous Mobile Multitasking Environments (이종 모바일 멀티태스킹 환경을 위한 실시간 작업 인지형 메모리 할당 기술 연구)

  • Bahn, Hyokyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.3
    • /
    • pp.43-48
    • /
    • 2022
  • Recently, due to the rapid performance improvement of smartphones and the increase in background executions of mobile apps, multitasking has become common on mobile platforms. Unlike traditional desktop and server apps, response time is important in most mobile apps as they are interactive tasks, and some apps are classified as real-time tasks with deadlines. In this paper, we discuss how to meet the requirements of heterogeneous multitasking in managing memory of real-time and interactive tasks when they are executed together on a smartphone. To do so, we analyze the memory requirement of real-time tasks, and propose a model that has the ability of allocating memory to multitasking tasks on a smartphone. Trace-driven simulations with real-world storage access traces captured by heterogeneous apps show that the proposed model provides reasonable performance for interactive tasks while guaranteeing the requirement of real-time tasks.

Ergonomic Recommendation for Optimum Positions and Warning Foreperiod of Auditory Signals in Human-Machine Interface

  • Lee, Fion C.H.;Chan, Alan H.S.
    • Industrial Engineering and Management Systems
    • /
    • v.6 no.1
    • /
    • pp.40-48
    • /
    • 2007
  • This study investigated the optimum positions and warning foreperiod for auditory signals with an experiment on spatial stimulus-response (S-R) compatibility effects. The auditory signals were presented at the front-right, front-left, rear-right, and rear-left positions from the subjects, whose reaction times and accuracies at different spatial mapping conditions were examined. The results showed a significant spatial stimulus-response compatibility effect in which faster and more accurate responses were obtained in the transversely and longitudinally compatible condition while the worst performance was found when spatial stimulus-response compatibility did not exist in either orientation. It was also shown that the transverse compatibility effect was found significantly stronger than the longitudinal compatibility effect. The effect of signal position was found significant and post hoc test suggested that the emergent warning alarm should be placed on the front-right position for right-handed users. The warning foreperiod prior to the signal presentation was shown to influence reaction time and a warning foreperiod of 3 s is found optimal for the 2-choice auditory reaction task.

A Study on the Impact of Price Change of International Crude Oil on Merchandise Balance (국제원유 가격변동이 상품수지에 미치는 영향 분석)

  • Son, Yong-Jung
    • International Commerce and Information Review
    • /
    • v.10 no.3
    • /
    • pp.459-474
    • /
    • 2008
  • Under violent competition to secure international raw materials, safe supply and demand of crude oil that only relies on import among main raw materials is an important task for Korean economic development. Therefore, this study aims to analyze the impact of price change of international crude oil on merchandise balance. It also presents political suggestions in preparation for national economic development and safety and develops an organized and long-term overseas resources development program. As the time-series data which had the 1st difference contribute to dismissal of the null hypothesis successfully, we carry out a multivariate cointegration test developed by Johansen (1988) and find that at least one cointegration vector exists. And, when Impulse Response Function is introduced, as the crude oil import price shows a negative impact from Step 2, then an extreme change, a positive impact since Step 13, is maintained and a safe result appears.

  • PDF

An Approach to Optimize Initial Offsets of Periodic Tasks in Real-Time Systems (실시간 시스템의 주기적 태스크의 최적 오프셋 탐색)

  • Kwon, Ji-Hye;Lee, Chang-Gun
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06a
    • /
    • pp.170-172
    • /
    • 2012
  • 실시간 시스템(real-time system)은 논리적 연산을 일정한 시간적 제약 하에서 수행하는 시스템이다. 시간적 제약을 충족하도록 주기적 태스크(periodic task)를 스케줄(schedule)할 때 일반적으로 태스크 오프셋(initial offset)이 0 이거나 고정된 것으로 가정한다. 그러나 오프셋에 약간의 유연성을 허용함으로써 태스크들의 평균 응답 시간을 줄일 수도 있다. 이 논문에서는 주기적 태스크의 오프셋을 주어진 허용 범위 안에서 선택하여 평균 응답 시간(response time)을 최적화할 수 있음을 보이고, 임의의 태스크 집합에 대하여 최적 오프셋이 존재하는 좁은 범위를 제시한다.

Improved Schedulability Analysis of Real-Time Sporadic Tasks with EDF Preemptive Scheduling

  • Darbandi, Armaghan;Kim, Myung-Kyun
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.4
    • /
    • pp.396-404
    • /
    • 2012
  • This paper proposes an analysis method to check the schedulability of a set of sporadic tasks under earliest deadline first (EDF) scheduler. The sporadic task model consists of subtasks with precedence constraints, arbitrary arrival times and deadlines. In order to determine the schedulability, we present an approach to find exact worst case response time (WCRT) of subtatsks. With the technique presented in this paper, we exploit the precedence relations between subtasks in an accurate way while taking advantage of the deadline of different subtasks. Another nice feature of our approach is that it avoids calculation time overhead by exploiting the concept of deadline busy period. Experimental results show that this consideration leads to a significant improvement compared with existing work.