اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWorst-Case Services and State-Based Scheduling
133
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we shed new light on a classical scheduling problem: given a slot-timed, constant-capacity server, what short-run scheduling decisions must be made to provide long-run service guarantees to competing flows of unit-sized tasks? We model the flows long-run guarantees as worst-case services that map each arrival vector recording a flows cumulative task arrivals to a worst-case acceptable departure vector lower-bounding its cumulative task departures. We show that these services are states that can be updated as tasks arrive and depart, introduce state-based scheduling, and find the schedulability condition that must be preserved to maintain all flows long-run guarantees. We then use this condition to identify, in each slot, all short-run scheduling decisions that preserve schedulability. To illustrate how scheduling complexity can be reduced, we additionally show that special schedules can be efficiently identified by maximizing the servers capacity slack, and that special services can be efficiently specified and updated using properties of the min-plus algebra.
قيم البحث
اقرأ أيضاً
The method of significant moment analysis has been employed to derive instantaneous schedulability tests for real-time systems. However, the instantaneous schedulability can only be checked within a finite time window. On the other hand, worst-case s
chedulability guarantees schedulability of systems for infinite time. This paper derives the classical worst-case schedulability conditions for preemptive periodic systems starting from instantaneous schedulability, hence unifying the two notions of schedulability. The results provide a rigorous justification on the critical time instants being the worst case for scheduling of preemptive periodic systems. The paper also show that the critical time instant is not the only worst case moments.
This work attempts to approximate a linear Gaussian system with a finite-state hidden Markov model (HMM), which is found useful in solving sophisticated event-based state estimation problems. An indirect modeling approach is developed, wherein a stat
e space model (SSM) is firstly identified for a Gaussian system and the SSM is then used as an emulator for learning an HMM. In the proposed method, the training data for the HMM are obtained from the data generated by the SSM through building a quantization mapping. Parameter learning algorithms are designed to learn the parameters of the HMM, through exploiting the periodical structural characteristics of the HMM. The convergence and asymptotic properties of the proposed algorithms are analyzed. The HMM learned using the proposed algorithms is applied to event-triggered state estimation, and numerical results on model learning and state estimation demonstrate the validity of the proposed algorithms.
Frequency response and voltage support are vital ancillary services for power grids. In this paper, we design and experimentally validate a real-time control framework for battery energy storage systems (BESSs) to provide ancillary services to power
grids. The objective of the control system is to utilize the full capability of the BESSs to provide ancillary services. We take the voltage-dependent capability curve of the DC-AC converter and the security requirements of BESSs as constraints of the control system. The initial power set-points are obtained based on the droop control approach. To guarantee the feasibility of the power set-points with respect to both the converter capability and BESS security constraints, the final power set-points calculation is formulated as a nonconvex optimization problem. A convex and computationally efficient reformulation of the original control problem is then proposed. We prove that the proposed convex optimization gives the global optimal solution to the original nonconvex problem. We improve the computational performance of this algorithm by discretizing the feasible region of the optimization model. We achieve a 100 ms update time of the controller setpoint computation in the experimental validation of the utility-scale 720 kVA / 560 kWh BESS on the EPFL campus.
In Part I of this paper series, several macroscopic traffic model elements for mathematically describing freeway networks equipped with managed lane facilities were proposed. These modeling techniques seek to capture at the macroscopic the complex ph
enomena that occur on managed lane-freeway networks, where two parallel traffic flows interact with each other both in the physical sense (how and where cars flow between the two lane groups) and the physiological sense (how driving behaviors are changed by being adjacent to a quantitatively and qualitatively different traffic flow). The local descriptions we developed in Part I are not the only modeling complexity introduced in managed lane-freeway networks. The complex topologies mean that network-scale modeling of a freeway corridor is increased in complexity as well. The already-difficult model calibration problem for a dynamic model of a freeway becomes more complex when the freeway becomes, in effect, two interrelating flow streams. In the present paper, we present an iterative-learning-based approach to calibrating our models physical and driver-behavioral parameters. We consider the common situation where a complex traffic model needs to be calibrated to recreate real-world baseline traffic behavior, such that counterfactuals can be generated by training purposes. Our method is used to identify traditional freeway parameters as well as the proposed parameters that describe managed lane-freeway-network-specific behaviors. We validate our model and calibration methodology with case studies of simulations of two managed lane-equipped California freeways.
State and parameter estimation is essential for process monitoring and control. Observability plays an important role in both state and parameter estimation. In simultaneous state and parameter estimation, the parameters are often augmented as extra
states of the original system. When the augmented system is observable, various existing state estimation approaches may be used to estimate the states and parameters simultaneously. However, when the augmented system is not observable, how we should proceed to maximally extract the information contained in the measured outputs is not clear. This paper concerns about simultaneous state and parameter estimation when the augmented system is not fully observable. Specifically, we first show how sensitivity analysis is related to observability of a dynamical system, and then illustrate how it may be used to select variables for simultaneous estimation. We also propose a moving horizon state estimation (MHE) design that can use the variable selection results in a natural way. Extensive simulations are carried out to show the efficiency of the proposed approach.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
