| 1. |
- Noterdaeme, J. M., et al.
(författare)
-
Heating, current drive and energetic particle studies on JET in preparation of ITER operation
- 2003
-
Ingår i: Nuclear Fusion. - : IOP Publishing. - 0029-5515 .- 1741-4326. ; 43:3, s. 202-209
-
Tidskriftsartikel (refereegranskat)abstract
- This paper summarizes the recent work on JET in the three areas of heating, current drive and energetic particles. The achievements have extended the possibilities of JET, have a direct connection to ITER operation and provide new and interesting physics. Toroidal rotation profiles of plasmas heated far off axis with little or no refuelling or momentum input are hollow with only small differences on whether the power deposition is located on the low field side or on the high field side. With LH current drive the magnetic shear was varied from slightly positive to negative. The improved coupling (through the use of plasma shaping and CD4) allowed up to 3.4 MW of PLH in internal transport barrier (ITB) plasmas with more than 15 MW of combined NBI and ICRF heating. The q-profile with negative magnetic shear and the ITB could be maintained for the duration of the high heating pulse (8 s). Fast ions have been produced in JET with ICRF to simulate alpha particles: by using third harmonic He-4 heating, beam injected He-4 at 120 kV were accelerated to energies above 2 MeV taking advantage of the unique capability of JET to use NBI with 4 He and to confine MeV class ions. ICRF heating was used to replicate the dynamics of alpha heating and the control of an equivalent Q = 10 `burn' was simulated.
|
|
| 2. |
- Abdelzaher, T., et al.
(författare)
-
The aperiodic multiprocessor utilization bound for liquid tasks
- 2002
-
Ingår i: 8th IEEE Real-Time and Embedded Technology and Applications Symposium, 2002. Proceedings. - 1545-3421. - 0769517390 ; , s. 173-184
-
Konferensbidrag (refereegranskat)abstract
- Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough has been Liu and Layland's utilization bound for schedulability of periodic tasks. In 2001 this bound was generalized by Abdelzaher and Lu to the aperiodic task case. In this paper we further generalize the aperiodic bound to the case of multiprocessors, and present key new insights into schedulability, analysis of aperiodic tasks. We consider a special task model, called the liquid task model, representative of high-performance servers with aperiodic workloads, such as network routers, web servers, proxies, and real-time databases. For this model, we derive the optimal multiprocessor utilization bound, defined on a utilization-like metric we call "synthetic utilization". This bound allows developing constant-time admission control tests that provide utilization-based absolute delay, tees. We show that the real utilization of admitted tasks can be close to unity even when synthetic utilization is kept below the bound. Thus, our results lead to multiprocessor systems which combine constant-time admission control with high utilization while making no periodicity assumptions regarding the task arrival pattern.
|
|
