Skip to main content
SpringerLink
Log in

Distributed Code and Data Propagation Algorithm for Longest Common Subsequence Problem Solving

  • Conference paper
Agent and Multi-Agent Systems: Technologies and Applications (KES-AMSTA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4496))

Abstract

This paper proposes a distributed code and data propagation algorithm for Longest Common Subsequence problem solving and compares this algorithm performance against the algorithm based on J2EE technology. The new algorithm builds a graph devised to propagate classes and data between different nodes and the client, whereas the J2EE algorithm requires more complex communication and database processing. The proposed algorithm’s performance in terms of number of nodes and execution time is better than or comparable to that of the existing algorithms.

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. Alves, C.R., Cáceres, E.N., Song, S.W.: Sequential and Parallel Algorithms for the All-Substrings Longest Common Subsequence Problem. RT-MAC-2003-03, Dept. de Ciência da Computação, IME, USP (April 2003)

    Google Scholar 

  2. Anderson, D.: BOINC: A System for Public-Resource Computing and Storage. In: 5th IEEE/ACM International Workshop on Grid Computing (November 2004)

    Google Scholar 

  3. Grama, A., Gupta, A., Kumar, V.: Isoefficiency Function: A Scalability Metric for Parallel Algorithms and Architectures, Department of Computer Science, University of Minnesota (1993)

    Google Scholar 

  4. Gruer, P., Hilaire, V., Koukam, A., Cetnarowicz, K.: A formal framework for multi-agent systems analysis and design. Expert Systems with Applications 23, 349–355 (2002)

    Article  MATH  Google Scholar 

  5. Haeuser, J., et al.: A test suite for high-performance parallel Java. Advances in Engineering Software 31, 687–696 (2000)

    Article  Google Scholar 

  6. Hirschberg, D.S.: Pattern Matching Algorithms: Serial computations of Levenshtein distances. Oxford University Press, Oxford (1997)

    Google Scholar 

  7. Irving, R.W.: Plagiarism and Collusion Detection using Smith-Waterman Algorithm. Tech. Rep. TR-2004-164, University of Glasgow, Computing Science Department Research Report (2004)

    Google Scholar 

  8. Kolp, M., Giorgini, P., Mylopoulos, J.: Multi-agent architectures as organizational structures. Auton. Agent Multi-Agent Sys. 13, 3–25 (2006)

    Article  MATH  Google Scholar 

  9. Laure, E.: OpusJava: A Java framework for distributed high performance computing. Future Generation Computer Systems 18, 235–251 (2001)

    Article  MATH  Google Scholar 

  10. Marrow, P., et al.: Agents in Decentralized Information Ecosystems: The DIET Approach. In: Proceedings of the AISB’01 Symposium on Information Agents for Electronic Commerce, AISB’01 Convention, University of York, United Kingdom (March 2001)

    Google Scholar 

  11. Matsuoka, S., Itou, S.: Towards performance evaluation on high-performance computing on multiple Java platforms. Future Generation Computer Systems 18, 281–291 (2001)

    Article  MATH  Google Scholar 

  12. Shehory, O., Kraus, S.: Methods for Task Allocation via Agent Coalition Formation. Artificial Intelligence 101(1-2), 165–200 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  13. Smith, T.F., Waterman, M.S.: Identification of Common Molecular Subsequences. J. Mol. Biol. 147, 195–197 (1981)

    Article  Google Scholar 

  14. Wilkinson, B., Allen, M.: Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers. Prentice-Hall, Englewood Cliffs (2004)

    Google Scholar 

  15. Xu, X., Chen, L., Pan, Y., He, P.: Fast Parallel Algorithms for the Longest Common Subsequence Problem Using an Optical Bus. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3482, pp. 338–348. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wrocław University of Technology, Institute of Applied Informatics, Wybrzeże S. Wyspiańskiego 27, 50-370 Wrocław, Poland

    Dariusz Król & Grzegorz Stanisław Kukla

Authors
  1. Dariusz Król
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grzegorz Stanisław Kukla
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ngoc Thanh Nguyen Adam Grzech Robert J. Howlett Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Król, D., Kukla, G.S. (2007). Distributed Code and Data Propagation Algorithm for Longest Common Subsequence Problem Solving. In: Nguyen, N.T., Grzech, A., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2007. Lecture Notes in Computer Science(), vol 4496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72830-6_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72830-6_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72829-0

  • Online ISBN: 978-3-540-72830-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation