Hα emission fluxes and lithium abundances of low-mass stars in the young open cluster IC 4665

As part of a long term effort to understand pre-main sequence Li burning, we have obtained high resolution spectroscopic observations of 14 late type stars (G0-M1) in the young open cluster IC 4665. Most of the stars have Hα filled-in and Li I absorption, as expected for their young age. From the equivalent widths of Hα emission excess (obtained using the spectral subtraction technique) and the the Li i λ6708 feature, we have derived Hα emission fluxes and photospheric Li abundances. The mean Li abundance of IC 4665 solar-type stars is log N(Li) = 3.1; the same as in other young clusters (α Per, Pleiades) and T Tauri stars. Our results support the conclusions from previous works that PMS Li depletion is very small for masses ∼ 1 M_⨀ . Among the IC 4665 late-G and early K-type stars, there is a spread in Li abundances of about one order of magnitude. The Li-poor IC 4665 members have low Hα excess and vsini≤10. Hence, the Li-activity-rotation connection which has been clearly established in the Pleiades also seems to hold in IC 4665. One M-type IC 4665 star that we have observed does not show Li, implying a very efficient Li depletion as observed in α Per stars of the same spectral type. The level of chromospheric activity and Li depletion among the low-mass stars of IC 4665 is similar to that in the Pleiades. In fact, we note that the Li abundance distributions in several young clusters (α Per, Pleiades, IC 2391, IC 4665) and in post T Tauri stars are strikingly similar. This result suggests that Hα emission and Li abundance not well correlated with age for low-mass stars between 20 and 100 Myr old. We argue that a finer age indicator, the ''LL-clock'', would be the luminosity at which the transition between efficient Li depletion and preservation takes place for fully convective objects. The LL-clock could allow in the near future to derive the relative ages of young open clusters, and clarify the study of PMS evolution of cool stars.

A Hardware Implementation of a Run-Time Scheduler for Reconfigurable Systems

New generation embedded systems demand high performance, efficiency and flexibility. Reconfigurable hardware can provide all these features. However the costly reconfiguration process and the lack of management support have prevented a broader use of these resources. To solve these issues we have developed a scheduler that deals with task-graphs at run-time, steering its execution in the reconfigurable resources while carrying out both prefetch and replacement techniques that cooperate to hide most of the reconfiguration delays. In our scheduling environment task-graphs are analyzed at design-time to extract useful information. This information is used at run-time to obtain near-optimal schedules, escaping from local-optimum decisions, while only carrying out simple computations. Moreover, we have developed a hardware implementation of the scheduler that applies all the optimization techniques while introducing a delay of only a few clock cycles. In the experiments our scheduler clearly outperforms conventional run-time schedulers based on As-Soon-As-Possible techniques. In addition, our replacement policy, specially designed for reconfigurable systems, achieves almost optimal results both regarding reuse and performance.

A Hardware Task-Graph Scheduler for Reconfigurable Multi-tasking Systems

Reconfigurable hardware can be used to build a multitasking system where tasks are assigned to HW resources at run-time according to the requirements of the running applications. These tasks are frequently represented as direct acyclic graphs and their execution is typically controlled by an embedded processor that schedules the graph execution. In order to improve the efficiency of the system, the scheduler can apply prefetch and reuse techniques that can greatly reduce the reconfiguration latencies. For an embedded processor all these computations represent a heavy computational load that can significantly reduce the system performance. To overcome this problem we have implemented a HW scheduler using reconfigurable resources. In addition we have implemented both prefetch and replacement techniques that obtain as good results as previous complex SW approaches, while demanding just a few clock cycles to carry out the computations. We consider that the HW cost of the system (in our experiments 3% of a Virtex-II PRO xc2vp30 FPGA) is affordable taking into account the great efficiency of the techniques applied to hide the reconfiguration latency and the negligible run-time penalty introduced by the scheduler computations.

Nanosecond-level time synchronization of autonomous radio detector stations for extensive air showers

To exploit the full potential of radio measurements of cosmic-ray air showers at MHz frequencies, a detector timing synchronization within 1 ns is needed. Large distributed radio detector arrays such as the Auger Engineering Radio Array (AERA) rely on timing via the Global Positioning System (GPS) for the synchronization of individual detector station clocks. Unfortunately, GPS timing is expected to have an accuracy no better than about 5 ns. In practice, in particular in AERA, the GPS clocks exhibit drifts on the order of tens of ns. We developed a technique to correct for the GPS drifts, and an independent method is used to cross-check that indeed we reach a nanosecond-scale timing accuracy by this correction. First, we operate a "beacon transmitter" which emits defined sine waves detected by AERA antennas recorded within the physics data. The relative phasing of these sine waves can be used to correct for GPS clock drifts. In addition to this, we observe radio pulses emitted by commercial airplanes, the position of which we determine in real time from Automatic Dependent Surveillance Broadcasts intercepted with a software-defined radio. From the known source location and the measured arrival times of the pulses we determine relative timing offsets between radio detector stations. We demonstrate with a combined analysis that the two methods give a consistent timing calibration with an accuracy of 2 ns or better. Consequently, the beacon method alone can be used in the future to continuously determine and correct for GPS clock drifts in each individual event measured by AERA.