skip to main content
research-article
Free Access

The one-second war

Published:01 May 2011Publication History
Skip Abstract Section

Abstract

Finding a lasting solution to the leap seconds problem has become increasingly urgent.

References

  1. International Earth Rotation and Reference Systems Service. Information on UTC-TAI; http://data.iers.org/products/16/14433/orig/bulletinc-041.txt.Google ScholarGoogle Scholar
  2. International Earth Rotation and Reference Systems Service. Relationship between TAI and UTC; http://hpiers.obspm.fr/eop-pc/earthor/utc/TAI-UTC_tab.html.Google ScholarGoogle Scholar
  3. Microsoft. How the Windows Time service treats a leap second (2006). (November 1); http://support.microsoft.com/kb/909614.Google ScholarGoogle Scholar
  4. Sobel, D. Longitude. Walker and Company, 2005.Google ScholarGoogle Scholar
  5. Williams, M. Power glitch hits Toshiba's flash memory production line. ComputerWorld (Dec. 2010); http://www.computerworld.com/s/article/9200738/Power_glitch_hits_Toshiba_s_flash_memory_production_line.Google ScholarGoogle Scholar

Index Terms

  1. The one-second war

              Recommendations

              Reviews

              Giuseppina Carla Gini

              "What time is it__?__" When we answer this trivial question, we don't care about seconds. However, as computer scientists, we should. The length of a second is astronomically defined in terms of the earth's rotation, and practically defined in the International System of Units (SI) in terms of periods of hyperfine radiation from cesium-133 atoms. Since there are small variations in the earth's rotation, the length of a second varies, and should be periodically determined. As a result, the decision to use SI seconds and do full-second step adjustments (leap seconds) started on January 1, 1972. In practice, twice a year, astronomers can determine whether the last minute of June and of December will consist of 59, 60, or 61 seconds. Why care about this adjustment__?__ The advent of large synchronized networks of computers requires that they are always aligned in time. Different systems managed the leap seconds in different ways. In practice, many of the network time protocol (NTP) servers had this one-second difference for a short time, both in 2005 and 2008, when the last leap seconds arrived. The problem is that many systems besides computers care about time, including air traffic control (ATC) systems and many industrial processing systems that are time critical. How can we be sure that all computers know about leap seconds and fix the code on time__?__ According to Kamp, nobody knows. The most-used solution is to maintain all of the critical systems for some time to cover the leap second. This is a waste of time and money. Why not abolish them__?__ Kamp advances another solution: if it were possible to know 20 years in advance when leap seconds were due, it would be easier to maintain them by simply adding the right number of seconds for every day into any program. But, he argues, are all programmers really able to do that__?__ Furthermore, don't more important problems exist__?__ Waiting to see if the proposal to abolish leap seconds will be accepted in January 2012, we can only agree with the practical considerations raised by the author. As scientists, however, we should consider a longer time horizon and broader reasons for our decisions. Online Computing Reviews Service

              Access critical reviews of Computing literature here

              Become a reviewer for Computing Reviews.

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image Communications of the ACM
                Communications of the ACM  Volume 54, Issue 5
                May 2011
                134 pages
                ISSN:0001-0782
                EISSN:1557-7317
                DOI:10.1145/1941487
                Issue’s Table of Contents

                Copyright © 2011 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 May 2011

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • research-article
                • Popular
                • Refereed

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader

              HTML Format

              View this article in HTML Format .

              View HTML Format