skip to main content
article
Free Access

The p-shovelers problem: (computing with time-varying data)

Published:01 May 1992Publication History
Skip Abstract Section

Abstract

In a winter morning one man shovels the snow from his driveway. When the job is finished he can get out with the car. In the neighbouring driveway p men remove the same amount of snow in one p-th of time. The next morning is snowy. As the single shoveler goes on, new snow falls making his job harder. The neighbouring shovelers work for a shorter time, and a smaller amount of snow falls meanwhile, so that they clean the driveway in less than one p-th of time. This seems to conflict with a folklore theorem on parallel speed-up.

References

  1. [Ak] S.G. Akl, "Memory access in models of parallel computation: from folklore to sinergy and beyond", Proc. WADS 91. In: LNCS 519, Sringer Verlag (1991) 92-104.Google ScholarGoogle Scholar
  2. [KR] R.M. Karp and V. Ramachandran, "A survey of parallel algorithms for shared memory machines", Handbook of Theor. Comp. Sci., North Holland (1990) 869-941. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [LP] F. Luccio and L. Pagli, "The p-shovelers problem. (Computing with time-varying data)", Dipartimento di Informatica, Università di Pisa, Tech. Rep. TR (Feb.1992).Google ScholarGoogle Scholar
  4. [Vi] U. Vishkin, "Can parallel algorithms enhance serial implementation?", SIGACT News 22 (Fall 1991) 63. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The p-shovelers problem: (computing with time-varying data)

          Recommendations

          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 ACM SIGACT News
            ACM SIGACT News  Volume 23, Issue 2
            Spring 1992
            26 pages
            ISSN:0163-5700
            DOI:10.1145/130956
            Issue’s Table of Contents

            Copyright © 1992 Authors

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 May 1992

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader