Please use this identifier to cite or link to this item:
Full metadata record
|dc.contributor.author||Prem, Kumar, M.|
|dc.identifier.citation||2018 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics, DISCOVER 2018 - Proceedings, 2019, Vol., , pp.82-87||en_US|
|dc.description.abstract||We see an increasing trend in the processing power and storage capacities of mobile phones. Combined with their large numbers and ubiquitous nature, they present new possibilities in the field of public resource computing, also called volunteer computing. An effective volunteer computing solution can be achieved by utilizing the idle CPU cycles and free storage space of these mobile phones. Existing solutions like BOINC cater mainly to large organizations and have complex procedures for submitting datasets and code for computation. Here we propose a novel distributed computing platform which enables the user to harness the public computing power with ease. The user needs to upload a dataset, the Java code that needs to be run on it, and the merge code that combines the results. We have come up with a distribution and scheduling algorithm which leverages the computational heterogeneity of the devices, the complexity of the task involved and the size of the dataset uploaded. The platform also provides a decentralized public storage, using which users can upload any file securely. It uses threshold cryptography on the uploaded files to create encrypted shares. This approach reduces the redundancy required to maintain availability. We have run a DNA sequence similarity algorithm on our system, utilizing a number of Android phones of different makes. Our results show that this approach is a viable, cost-efficient alternative to traditional distributed computing resources for performing non-time bound computations on large datasets. � 2018 IEEE.||en_US|
|dc.title||Distributed Public Computing and Storage using Mobile Devices||en_US|
|Appears in Collections:||2. Conference Papers|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.