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

Authors:
Dariusz Król;Grzegorz Stanisław Kukla
Affiliations:
Wrocław University of Technology, Institute of Applied Informatics, Wybrzeże S. Wyspiańskiego 27, 50-370 Wrocław, Poland;Wrocław University of Technology, Institute of Applied Informatics, Wybrzeże S. Wyspiańskiego 27, 50-370 Wrocław, Poland
Venue:
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Year:
2007

Citing 9
Cited 0

Serial computations of Levenshtein distances

Pattern matching algorithms
A test suite for high-performance parallel Java

Advances in Engineering Software - Special issue on large-scale analysis, design and intelligent synthesis environments
OpusJava: a Java framework for distributed high performance computing

Future Generation Computer Systems - Java in high-performance computing
Towards performance evaluation of high-performance computing on multiple Java platforms

Future Generation Computer Systems - Java in high-performance computing
Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers (2nd Edition)

Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers (2nd Edition)
BOINC: A System for Public-Resource Computing and Storage

GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Multi-Agent Architectures as Organizational Structures

Autonomous Agents and Multi-Agent Systems
Methods for task allocation via agent coalition formation

Artificial Intelligence
Fast parallel algorithms for the longest common subsequence problem using an optical bus

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

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.