Please use this identifier to cite or link to this item: http://hdl.handle.net/11400/11315
Title: Efficient BSP/CGM algorithms for text retreval
Authors: Γαβαλάς, Δαμιανός
Κωνσταντόπουλος, Χαράλαμπος
Μάμαλης, Βασίλης
Πάντζιου, Γραμματή Ε.
Item type: Conference publication
Conference Item Type: Full Paper
Keywords: μοντέλο BSP;μοντέλο CGM;παράλληλοι αλγόριθμοι;ανάκτηση κειμένου;ομαδοποίηση εγγράφων;BSP model;CGM model;Parallel algorithms;text retrieval;Document clustering
Subjects: Πληροφορική
Μαθηματικά
Computer science
Mathematics
Issue Date: 28-May-2015
2005
Date of availability: 27-May-2015
Abstract: In this paper we present efficient, scalable and portable parallel algorithms written in the Coarse-Grained Multicomputer (CGM) and the Bulk Synchronous Parallel (BSP) models for the off-line clustering, the on-line retrieval and the update phases of the text retrieval problem based on the vector space model and using clustering to organize and handle a dynamic document collection. To the best of our knowledge, our parallel retrieval algorithms are the first ones analyzed under specific parallel models, which capture within a few parameters the characteristics of the parallel machine.
Language: English
Citation: Gavalas, D., Pantziou, G., Konstantopoulos, C. and Mamalis, B. (2005) Efficient BSP/CGM Algorithms for Text Retreval. Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS’2005). pp.301-306.
Conference: Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS’2005)
Access scheme: Publicly accessible
License: Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες
URI: http://hdl.handle.net/11400/11315
Appears in Collections:Δημοσιεύσεις

Files in This Item:
File Description SizeFormat 
10.1.1.98.7198.pdf163.12 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons