Search NASASearch

SEARCH · Search NASA

Results for “stragglers”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

38 records · Page 3

Observing the First Stars in Luminous, Red Galaxies

Modern cosmological simulations predict that the first stars are to be found today in luminous, red galaxies. Although observing such stars individually against a background of younger, metal-rich stars is impossible, the first stars should make their presence known by their strong, line-free ultraviolet flux. We have found evidence for a UV-bright stellar population in Sloan spectra of LRG's at z=0.4-0.5. We present arguments for interpreting this UV-bright stellar population as the oldest stars, rather than other types of stellar populations (e.g. young stars or blue straggler stars in the dominant, metal-rich stellar population

Heap, Sally

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING