Diskless data analytics on distributed coordination systems
| dc.contributor.advisor | Kent, Kenneth | |
| dc.contributor.author | Dilli, Dayal | |
| dc.date.accessioned | 2023-03-01T16:29:31Z | |
| dc.date.available | 2023-03-01T16:29:31Z | |
| dc.date.issued | 2013 | |
| dc.date.updated | 2016-03-31T00:00:00Z | |
| dc.description.abstract | A distributed system contains software programs, applications and data resources dispersed across independent computers connected through a communication network. Distributed coordination systems are file-system like distributed meta-data stores that ensure consistency between processes of the distributed system. The challenge in this area is to perform processing fast enough on data that is continuously changing. The focus of this research is to reduce the disk bound time of a chosen distributed coordination system called Apache Zookeeper. By reducing the disk dependency, the performance will be improved. The shortcoming of this approach is that data is volatile on failures. The durability of the data is provided by replicating the data and restoring it from other nodes in the distributed ensemble. On average, a 30 times write performance improvement has been achieved with this approach. | |
| dc.description.copyright | © Dayal Dilli, 2014 | |
| dc.format | text/xml | |
| dc.format.extent | xii, 118 pages | |
| dc.format.medium | electronic | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/13965 | |
| dc.language.iso | en_CA | |
| dc.publisher | University of New Brunswick | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | Diskless data analytics on distributed coordination systems | |
| dc.type | master thesis | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.fullname | Master of Computer Science | |
| thesis.degree.grantor | University of New Brunswick | |
| thesis.degree.level | masters | |
| thesis.degree.name | M.C.S. |
Files
Original bundle
1 - 1 of 1