skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Algorithms for a Satellite Constellation Scheduling Problem.

Abstract

Abstract not provided.

Authors:
 [1];  [1];  [1];  [1];  [1];
  1. (TAMU)
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1369610
Report Number(s):
SAND2016-6474C
644501
DOE Contract Number:
AC04-94AL85000
Resource Type:
Conference
Resource Relation:
Conference: Proposed for presentation at the 12th IEEE International Conference on Automation Science and Engineering held August 21-24, 2016 in Fort Worth, Texas.
Country of Publication:
United States
Language:
English

Citation Formats

Sundar, Kaarthik, Qin, Jianglei, Rathinam, Sivakumar, Ntaimo, Lewis, Darbha, Swaroop, and Valicka, Christopher G. Algorithms for a Satellite Constellation Scheduling Problem.. United States: N. p., 2016. Web. doi:10.1109/COASE.2016.7743431.
Sundar, Kaarthik, Qin, Jianglei, Rathinam, Sivakumar, Ntaimo, Lewis, Darbha, Swaroop, & Valicka, Christopher G. Algorithms for a Satellite Constellation Scheduling Problem.. United States. doi:10.1109/COASE.2016.7743431.
Sundar, Kaarthik, Qin, Jianglei, Rathinam, Sivakumar, Ntaimo, Lewis, Darbha, Swaroop, and Valicka, Christopher G. 2016. "Algorithms for a Satellite Constellation Scheduling Problem.". United States. doi:10.1109/COASE.2016.7743431. https://www.osti.gov/servlets/purl/1369610.
@article{osti_1369610,
title = {Algorithms for a Satellite Constellation Scheduling Problem.},
author = {Sundar, Kaarthik and Qin, Jianglei and Rathinam, Sivakumar and Ntaimo, Lewis and Darbha, Swaroop and Valicka, Christopher G.},
abstractNote = {Abstract not provided.},
doi = {10.1109/COASE.2016.7743431},
journal = {},
number = ,
volume = ,
place = {United States},
year = 2016,
month = 7
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • Abstract not provided.
  • Abstract not provided.
  • Abstract not provided.
  • Processor speed and memory capacity are increasing several times faster than disk speed. This disparity suggests that disk I/O performance will become an important bottleneck. Methods are needed for using disks more efficiently. Past analysis of disk scheduling algorithms has largely been experimental and little attempt has been made to develop algorithms with provable performance guarantees. We consider the following disk scheduling problem. Given a set of requests on a computer disk and a convex reachability function which determines how fast the disk head travels between tracks, our goal is to schedule the disk head so that it services allmore » the requests in the shortest time possible. We present a 312-approximation algorithm (with a constant additive term). For the special case in which the reachability function is linear we present an optimal polynomial-time solution. The disk scheduling problem is related to the special case of the asymmetric Traveling Salesman Problem with the triangle inequality (ATSP-{Delta}) in which all distances are either 0 or some constants. We show how to find the optimal tour in polynomiaI time and describe how this gives another approximation algorithm for the disk scheduling problem. Finally we consider the on-line version of the problem in which uniformly-distributed requests arrive over time. We present an algorithm (related to the above ATSP-{Delta}) that appears to give higher throughput than previously existing head scheduling algorithms.« less
  • Abstract not provided.