5.00
Hdl Handle:
http://hdl.handle.net/10547/270614
Title:
A parallel algorithm to calculate the costrank of a network
Authors:
Hamid, Thaier; Maple, Carsten; Yue, Yong
Abstract:
We developed analogous parallel algorithms to implement CostRank for distributed memory parallel computers using multi processors. Our intent is to make CostRank calculations for the growing number of hosts in a fast and a scalable way. In the same way we intent to secure large scale networks that require fast and reliable computing to calculate the ranking of enormous graphs with thousands of vertices (states) and millions or arcs (links). In our proposed approach we focus on a parallel CostRank computational architecture on a cluster of PCs networked via Gigabit Ethernet LAN to evaluate the performance and scalability of our implementation. In particular, a partitioning of input data, graph files, and ranking vectors with load balancing technique can improve the runtime and scalability of large-scale parallel computations. An application case study of analogous Cost Rank computation is presented. Applying parallel environment models for one-dimensional sparse matrix partitioning on a modified research page, results in a significant reduction in communication overhead and in per-iteration runtime. We provide an analytical discussion of analogous algorithms performance in terms of I/O and synchronization cost, as well as of memory usage.
Citation:
Hamid, T., Maple, C. and Yue, Y. (2012) 'A parallel algorithm to calculate the costrank of a network', International Journal of Computer Applications, 44 (3), pp.17-22.
Publisher:
Foundation of Computer Science, New York, USA
Journal:
International Journal of Computer Applications
Issue Date:
2012
URI:
http://hdl.handle.net/10547/270614
DOI:
10.5120/6243-8161
Additional Links:
http://research.ijcaonline.org/volume44/number3/pxc3878161.pdf
Type:
Article
Language:
en
ISSN:
0975-8887
Appears in Collections:
Centre for Research in Distributed Technologies (CREDIT)

Full metadata record

DC FieldValue Language
dc.contributor.authorHamid, Thaieren_GB
dc.contributor.authorMaple, Carstenen_GB
dc.contributor.authorYue, Yongen_GB
dc.date.accessioned2013-02-28T10:20:04Z-
dc.date.available2013-02-28T10:20:04Z-
dc.date.issued2012-
dc.identifier.citationHamid, T., Maple, C. and Yue, Y. (2012) 'A parallel algorithm to calculate the costrank of a network', International Journal of Computer Applications, 44 (3), pp.17-22.en_GB
dc.identifier.issn0975-8887-
dc.identifier.doi10.5120/6243-8161-
dc.identifier.urihttp://hdl.handle.net/10547/270614-
dc.description.abstractWe developed analogous parallel algorithms to implement CostRank for distributed memory parallel computers using multi processors. Our intent is to make CostRank calculations for the growing number of hosts in a fast and a scalable way. In the same way we intent to secure large scale networks that require fast and reliable computing to calculate the ranking of enormous graphs with thousands of vertices (states) and millions or arcs (links). In our proposed approach we focus on a parallel CostRank computational architecture on a cluster of PCs networked via Gigabit Ethernet LAN to evaluate the performance and scalability of our implementation. In particular, a partitioning of input data, graph files, and ranking vectors with load balancing technique can improve the runtime and scalability of large-scale parallel computations. An application case study of analogous Cost Rank computation is presented. Applying parallel environment models for one-dimensional sparse matrix partitioning on a modified research page, results in a significant reduction in communication overhead and in per-iteration runtime. We provide an analytical discussion of analogous algorithms performance in terms of I/O and synchronization cost, as well as of memory usage.en_GB
dc.language.isoenen
dc.publisherFoundation of Computer Science, New York, USAen_GB
dc.relation.urlhttp://research.ijcaonline.org/volume44/number3/pxc3878161.pdfen_GB
dc.rightsArchived with thanks to International Journal of Computer Applicationsen_GB
dc.subjectparallel computingen_GB
dc.subjectdistributed algorithmsen_GB
dc.subjectpageranken_GB
dc.titleA parallel algorithm to calculate the costrank of a networken
dc.typeArticleen
dc.identifier.journalInternational Journal of Computer Applicationsen_GB
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.