Skip to main content
SpringerLink
Log in

A Novel Approach for Matrix Chain Multiplication Using Greedy Technique for Packet Processing

  • Conference paper
Computer Networks and Information Technologies (CNC 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 142))

Abstract

Matrix chain multiplication is one of well known application of optimization problem. There are N matrices of different size were given and we have to multiply them based on their row and column size. The order in which matrices are multiplied may change the number of computations. This shows the use of greedy technique to solve this problem in O(NlogN) time which we are applying for packet processing in routing.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. McGraw-Hill publication, New York (2002)

    MATH  Google Scholar 

  2. Thomson Leighton, F.: Introduction to parallel algorithms and architectures: array, trees, hypercubes. Morgan Kaufmann Publishers Inc., San Francisco (1991)

    Google Scholar 

  3. Huang, X., Pan, V.Y.: Fast rectangular matrix multiplication and applications. Journal of Complexity 14(2), 257–299 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Raz, R.: On the Complexity of Matrix Product. SIAM Journal on Computing 32(5), 1356–1369 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Shpilka, A.: Lower Bounds for Matrix Product. SIAM Journal on Computing 32(5), 1185–1200 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ezouaoui, S., Ben Charrada, F., Mahjoub, Z.: On instances of the matrix chain product problem solved in linear time. In: ROADEF 2009 (2009)

    Google Scholar 

  7. Godbole, S.: An Efficient Computation of Matrix Chain Products. IEEE Trans. Computers 22(9), 864–866 (1973)

    Article  Google Scholar 

  8. Chandra, A.: Computing Matrix Chain Products in Near-Optimal Time. technical report, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., IBM Research Report RC 5625(#24393) (1975)

    Google Scholar 

  9. Santoro, N.: Chain mulitplication of matrices of approximately or exactly the same size. Communications of the ACM 27(2), 152–156 (1984)

    Article  MathSciNet  Google Scholar 

  10. Yuster, R., Zwick, U.: Fast sparse matrix multiplication. ACM Transactions on Algorithms (TALG) 1(1), 2–13 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hu, T.C., Shing, M.T.: Computation of matrix chain products. Part II. SIAM Journal on Computing 13(2), 228–251 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hu, T., Shing, M.: Computation of matrix chain products I. SIAM J. Comput. 11(2), 362–373 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  13. Bradford, P.G., Rawlins, G.J.E., Shannon, G.E.: Efficient matrix chain ordering in polylog time. In: Eighth International Proceedings Parallel Processing Symposium, April 26-29, pp. 234–241 (1994)

    Google Scholar 

  14. Atallah, M.J., Kosaraju, S.R.: An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. In: SODA 1991, pp. 394–403 (1991); And to appear in the Journal of Algorithms

    Google Scholar 

  15. Bradford, P.G., Rawlins, G.J.E., Shannon, G.E.: Matrix Chain Ordering in Polylog Time with n/lgn Processors (October 1992) (full version)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. B.H. Gardi College of Engineering and Technology, Rajkot, Gujarat, India

    Hitesh Nimbark & Shobhen Gohel

  2. Sardar Vallabhbhai National Institute of Technology, Surat, Gujarat, India

    Nishant Doshi

Authors
  1. Hitesh Nimbark
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shobhen Gohel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nishant Doshi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineers Network, Trivandrum, Kerala, India

    Vinu V Das

  2. ILAHIA College of Engineering, Kothamangalam, India

    Janahanlal Stephen

  3. Guru Jambheshwar University of Science and Technology, Hisar, Haryana, India

    Yogesh Chaba

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nimbark, H., Gohel, S., Doshi, N. (2011). A Novel Approach for Matrix Chain Multiplication Using Greedy Technique for Packet Processing. In: Das, V.V., Stephen, J., Chaba, Y. (eds) Computer Networks and Information Technologies. CNC 2011. Communications in Computer and Information Science, vol 142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19542-6_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19542-6_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19541-9

  • Online ISBN: 978-3-642-19542-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation