Efficient parallel Text Retrieval techniques on Bulk Synchronous Parallel (BSP)/Coarse Grained Multicomputers (CGM)

dc.contributor.author	Κωνσταντόπουλος, Χαράλαμπος	el
dc.contributor.author	Μάμαλης, Βασίλης	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Γαβαλάς, Δαμιανός	el
dc.date.accessioned	2015-05-23T17:25:14Z
dc.date.issued	2015-05-23
dc.identifier.uri	http://hdl.handle.net/11400/11009
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://link.springer.com/article/10.1007%2Fs11227-008-0225-x	en
dc.subject	Παράλληλοι αλγόριθμοι
dc.subject	Ανάκτηση κειμένου
dc.subject	Ομαδοποίηση εγγράφων
dc.subject	Εξωτερική μνήμη
dc.subject	Parallel algorithms
dc.subject	Text retrieval
dc.subject	Document clustering
dc.subject	External memory
dc.title	Efficient parallel Text Retrieval techniques on Bulk Synchronous Parallel (BSP)/Coarse Grained Multicomputers (CGM)	en
heal.type	journalArticle
heal.classification	Πληροφορική
heal.classification	Μηχανική υπολογιστών
heal.classification	Computer science
heal.classification	Computer engineering
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	N/A-Μηχανική υπολογιστών
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.classificationURI	http://id.loc.gov/authorities/subjects/sh85029495
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh98003394
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh2007004888
heal.identifier.secondary	DOI: 10.1007/s11227-008-0225-x
heal.dateAvailable	10000-01-01
heal.language	en
heal.access	forever
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	2009-06
heal.bibliographicCitation	Konstantopoulos, C., Mamalis, B., Pantziou, G. and Gavalas, D. (2009) Efficient parallel Text Retrieval techniques on Bulk Synchronous Parallel (BSP)/Coarse Grained Multicomputers (CGM). The Journal of Supercomputing. [Online] 48 (3). pp.286-318. Available from: http://link.springer.com [Accessed 23/05/2015]	en
heal.abstract	In this paper, we present efficient, scalable, and portable parallel algorithms for the off-line clustering, the on-line retrieval and the update phases of the Text Retrieval (TR) problem based on the vector space model and using clustering to organize and handle a dynamic document collection. The algorithms are running on the Coarse-Grained Multicomputer (CGM) and/or the Bulk Synchronous Parallel (BSP) model which are two models that capture within a few parameters the characteristics of the parallel machine. To the best of our knowledge, our parallel retrieval algorithms are the first ones analyzed under these specific parallel models. For all the phases of the proposed algorithms, we analytically determine the relevant communication and computation cost thereby formally proving the efficiency of the proposed solutions. In addition, we prove that our technique for the on-line retrieval phase performs very well in comparison to other possible alternatives in the typical case of a multiuser information retrieval (IR) system where a number of user queries are concurrently submitted to an IR system. Finally, we discuss external memory issues and show how our techniques can be adapted to the case when processors have limited main memory but sufficient disk capacity for holding their local data.	en
heal.publisher	Springer US	en
heal.journalName	The Journal of Supercomputing	en
heal.journalType	peer-reviewed
heal.fullTextAvailability	false