Skip to main content
SpringerLink
Log in
Book cover

International Conference on High-Performance Computing

HiPC 1999: High Performance Computing – HiPC’99 pp 261–268Cite as

Parallel Real Root Isolation Using the Descartes Method

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1745))

Abstract

Two new scheduling algorithms are presented. They are used to isolate polynomial real roots on massively parallel systems. One algorithm schedules computations modeled by a pyramid DAG. This is a directed acyclic graph isomorphic to Pascal’s triangle. Pyramid DAGs are scheduled so that the communication overhead is linear. The other algorithm schedules parallelizable independent tasks that have identical computing time functions in the number of processors. The two algorithms are combined to schedule a tree-search for polynomial real roots; the first algorithm schedules the computations associated with each node of the tree; the second algorithm schedules the nodes on each level of the tree.

Supported by German Science Foundation (DFG) Project SFB-376, by European Union ESPRIT LTR Project 20244 (ALCOM-IT), and by European Union TMR-grant ERB-FMGECT95- 0051.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boeres, C., Chochia, G., Thanisch, P.: On the scope of applicability of the ETF algorithm. In: Ferreira, A., Rolim, J.D.P. (eds.) IRREGULAR 1995. LNCS, vol. 980, pp. 159–164. Springer, Heidelberg (1995)

    Google Scholar 

  2. Collins, G.E., Akritas, A.G.: Polynomial real root isolation using Descartes’ rule of signs. In: Jenks, R.D. (ed.) Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, pp. 272–275. ACM, New York (1976)

    Chapter  Google Scholar 

  3. Collins, G.E., Johnson, J.R., Küchlin, W.: Parallel real root isolation using the coefficient sign variation method. In: Zippel, R.E. (ed.) CAP 1990. LNCS, vol. 584, pp. 71–87. Springer, Heidelberg (1992)

    Google Scholar 

  4. Culler, D., Kark, R., Patterson, D., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R., von Eicken, T.: LogP: Towards a realistic model of parallel computation. In: Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 1–12. ACM, New York (1993)

    Chapter  Google Scholar 

  5. Decker, T.: Virtual Data Space—A universal load balancing scheme. In: Lüling, R., Bilardi, G., Ferreira, A., Rolim, J.D.P. (eds.) IRREGULAR 1997. LNCS, vol. 1253, pp. 159–166. Springer, Heidelberg (1997)

    Google Scholar 

  6. Du, J., Leung, Y.-T.: Complexity of scheduling parallel tasks systems. SIAM Journal of Discrete Mathematics 2(4), 473–487 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dowling, M.L.: A fast parallel Horner algorithm. SIAM Journal on Computing 19(1), 133–142 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gengler, M.: An introduction to parallel and dynamic programming. In: Ferreira, A., Pardalos, P.M. (eds.) SCOOP 1995. LNCS, vol. 1054, pp. 87–114. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  9. Grama, A., Gupta, A., Kumar, V.: Isoefficiency function: A scalability metric for parallel algorithms and architectures. IEEE Parallel and Distributed Technology, Special Issue on Parallel and Distributed Systems: From Theory to Practice 1(3), 12–21 (1993)

    Google Scholar 

  10. Galil, Z., Park, K.: Parallel algorithms for dynamic programming recurrences with more than o(1) dependency. Journal of Parallel and Distributed Computing 21, 213–222 (1994)

    Article  MATH  Google Scholar 

  11. Hwang, J.-J., Chow, Y.-C., Anger, F.D., Lee, C.-Y.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal of Computing 18(2), 244–257 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  12. Huang, S.-H.S., Liu, H., Viswanathan, V.: A sublinear parallel algorithm for some dynamic programming problems. Theoretical Computer Science 106, 361–371 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  13. Karypis, G., Kumar, V.: Efficient parallel formulations for some dynamic programming algorithms. In: Proc. of the 7th International Parallel Processing Symposium, IPPS (1993)

    Google Scholar 

  14. Krishnamurti, R., Ma, E.: An approximation algorithm for scheduling tasks on varying partition sizes in partitionable multiprocessor systems. IEEE Transactions on Computers 41(12), 1572–1579 (1992)

    Article  Google Scholar 

  15. Krandick, W.: Isolierung reeller Nullstellen von Polynomen. In: Herzberger, J. (ed.) Wissenschaftliches Rechnen, pp. 105–154. Akademie Verlag, Berlin (1995)

    Google Scholar 

  16. Lewandowski, G., Condon, A., Bach, E.: Asynchronous analysis of parallel dynamic programming algorithms. IEEE Transactions on Parallel and Distributed Systems 7(4), 425–437 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Paderborn, Paderborn, Germany

    Thomas Decker & Werner Krandick

Authors
  1. Thomas Decker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Werner Krandick
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Engineering, University of Illinois at Chicago, 851 South Morgan Street, IL 60607-7043, Chicago

    Prith Banerjee

  2. Department of Electrical Engineering, University of Southern California, CA 90089-2562, Los Angeles, USA

    Viktor K. Prasanna

  3. Indian Statistical Institute, ACM Unit, 700 108, Kolkata, India

    Bhabani P. Sinha

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Decker, T., Krandick, W. (1999). Parallel Real Root Isolation Using the Descartes Method. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46642-0_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66907-4

  • Online ISBN: 978-3-540-46642-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation