University of Arizona

About: University of Arizona is a education organization based out in Tucson, Arizona, United States. It is known for research contribution in the topics: Population & Galaxy. The organization has 63805 authors who have published 155998 publications receiving 6854915 citations. The organization is also known as: UA & U of A.

The Spitzer Space Telescope mission

Abstract: The Spitzer Space Telescope, NASA's Great Observatory for infrared astronomy, was launched 2003 August 25 and is returning excellent scientific data from its Earth-trailing solar orbit. Spitzer combines the intrinsic sensitivity achievable with a cryogenic telescope in space with the great imaging and spectroscopic power of modern detector arrays to provide the user community with huge gains in capability for exploration of the cosmos in the infrared. The observatory systems are largely performing as expected, and the projected cryogenic lifetime is in excess of 5 years. This paper summarizes the on-orbit scientific, technical, and operational performance of Spitzer. Subsequent papers in this special issue describe the Spitzer instruments in detail and highlight many of the exciting scientific results obtained during the first 6 months of the Spitzer mission.

The ATLAS Experiment at the CERN Large Hadron Collider

Abstract: The ATLAS detector as installed in its experimental cavern at point 1 at CERN is described in this paper. A brief overview of the expected performance of the detector when the Large Hadron Collider begins operation is also presented.

Performance-effective and low-complexity task scheduling for heterogeneous computing

Abstract: Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NP-complete in general cases as well as in several restricted cases. Because of its key importance, this problem has been extensively studied and various algorithms have been proposed in the literature which are mainly for systems with homogeneous processors. Although there are a few algorithms in the literature for heterogeneous processors, they usually require significantly high scheduling costs and they may not deliver good quality schedules with lower costs. In this paper, we present two novel scheduling algorithms for a bounded number of heterogeneous processors with an objective to simultaneously meet high performance and fast scheduling time, which are called the Heterogeneous Earliest-Finish-Time (HEFT) algorithm and the Critical-Path-on-a-Processor (CPOP) algorithm. The HEFT algorithm selects the task with the highest upward rank value at each step and assigns the selected task to the processor, which minimizes its earliest finish time with an insertion-based approach. On the other hand, the CPOP algorithm uses the summation of upward and downward rank values for prioritizing tasks. Another difference is in the processor selection phase, which schedules the critical tasks onto the processor that minimizes the total execution time of the critical tasks. In order to provide a robust and unbiased comparison with the related work, a parametric graph generator was designed to generate weighted directed acyclic graphs with various characteristics. The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithms significantly surpass previous approaches in terms of both quality and cost of schedules, which are mainly presented with schedule length ratio, speedup, frequency of best results, and average scheduling time metrics.