Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/2295
DC FieldValueLanguage
dc.contributor.authorŠandrih, Branislavaen_US
dc.contributor.authorFilipović, Vladimiren_US
dc.contributor.authorMalkov, Sašaen_US
dc.contributor.authorKartelj, Aleksandaren_US
dc.date.accessioned2025-07-23T14:28:02Z-
dc.date.available2025-07-23T14:28:02Z-
dc.date.issued2017-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/2295-
dc.description.abstractDistributed computing implies presence of unused software resources available on multiple computers that work as a single system. This kind of computing uses a system with parallel architecture and varying node reliability. As a consequence, an adequate programming paradigm has to be used. Web application, described in this paper, is designed with such paradigm in mind. It is developed using popular technologies. Proposed approach can attract two types of users: ones that need additional computing resources (in further text seekers) and ones that are willing to contribute by putting their computing resources on disposal (in further text helpers). Seeker is obligated to share their data which is then divided into equal segments. Number of these equal segments is defined by seeker in advance. Secondly, seeker has to define processing procedure, i.e. code for processing these segments separately. Eventually, they should define the way how processed segments are reduced into final result. Described programming paradigm is known as MapReduce. Data can be in arbitrary format (at the moment, the system is evaluated for text and images) as long as the map-function handles it in the appropriate way. Helper is assigned a segment of the input data. Map-function, defined by the seeker, is then executed within helper’s Web browser and its result is being returned to the system when processing procedure finished. The Web application’s efficiency depends on the number and configuration of computing nodes. Four different use-cases are demonstrated in this paper: 1) word counting in file containing text, 2) finding the largest number in the text file that contains numbers, 3) sharpening of the corrupted image and 4) applying blur effect on the image file. Since its simplicity and universality, the system has potential for other more complex computations and could, in the future, be applied in the domain of distributed content digitalization, analysis of the data obtained from telescopes etc.en_US
dc.language.isoenen_US
dc.publisherBeograd : Matematički fakultet, Nacionalni centar za digitalizacijuen_US
dc.relation.ispartofPregled Nacionalnog centra za digitalizaciju=NCD Reviewen_US
dc.subjectDistributed computingen_US
dc.subjectgrid computingen_US
dc.subjectmeta computingen_US
dc.subjectpeer-to-peer computingen_US
dc.subjectMapReduce paradigmen_US
dc.subjectimage processingen_US
dc.subjectdigitalizationen_US
dc.titleDistributed Computing among independent Web Browsers applied to Text and Image Processingen_US
dc.typeArticleen_US
dc.identifier.urlhttps://www.ncd.matf.bg.ac.rs/issues/31/NCD31030.pdf-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.issn1820-0109en_US
dc.description.rankM53en_US
dc.relation.firstpage30en_US
dc.relation.lastpage39en_US
dc.relation.volume31en_US
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairetypeArticle-
item.cerifentitytypePublications-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0002-5943-8037-
crisitem.author.orcid0000-0002-4385-6322-
crisitem.author.orcid0000-0001-9839-6039-
Appears in Collections:Research outputs
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.