Publicação
Deducing Operation Commutativity from Replicated Data Declaration
| datacite.subject.fos | Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática | pt_PT |
| dc.contributor.advisor | Paulino, Hervé | |
| dc.contributor.author | Fragoso, André Gonçalves | |
| dc.date.accessioned | 2020-03-04T11:22:13Z | |
| dc.date.available | 2020-03-04T11:22:13Z | |
| dc.date.issued | 2019-12 | |
| dc.date.submitted | 2019 | |
| dc.description.abstract | Distributed systems often resort to data replication not only to enhance their availability but also to reduce user-perceived latency by balancing the load between replicas and routing their requests accordingly. The choice of which consistency level that should be adopted by these replicated systems is critical for the fulfilment of their performance and correctness requirements. However, defining a strategy that strikes the right balance between these concerns in this type of environments is far from being a trivial task due to the related overheads that are amplified in distributed scenarios. Recognising the tension between latency and consistency, many systems allow multiple consistency levels to coexist. Nevertheless, the performance fine-tuning mechanisms supported by the existing hybrid solutions place a high burden on the programmer since the necessary input can be somehow complex requiring him to understand the semantics of each operation of the service he is developing in order to correctly instruct the system on how to handle concurrent updates. Thus, specifying operation dependencies, orderings and invariants to be preserved or even picking the right consistency level to be assigned to a certain data item is, generally, an error-prone task that hinders reasoning. To overcome this adversity, this work aims to reduce the effort spent by the programmer by only requiring the latter to introduce a simple and intuitive input at data declaration. Following this approach, reasoning is centralised and all accesses to replicated data are identified automatically. With all data accesses identified, it is then possible to deduce the side effects of each operation and determine, for each one of them, those with which it conflicts. In this context, this thesis also presents a compile-time analysis applied to the Java language able to evaluate operation pairwise commutativity from the input given at data declaration. | pt_PT |
| dc.identifier.uri | http://hdl.handle.net/10362/93771 | |
| dc.language.iso | eng | pt_PT |
| dc.relation | Distributed Data Centric Concurrency Control | |
| dc.subject | replicated systems | pt_PT |
| dc.subject | consistency levels | pt_PT |
| dc.subject | data-centric concurrency control | pt_PT |
| dc.subject | language interpretation | pt_PT |
| dc.title | Deducing Operation Commutativity from Replicated Data Declaration | pt_PT |
| dc.type | master thesis | |
| dspace.entity.type | Publication | |
| oaire.awardNumber | UID/CEC/04516/2013 | |
| oaire.awardNumber | PTDC/CCI-COM/32166/2017 | |
| oaire.awardTitle | Distributed Data Centric Concurrency Control | |
| oaire.awardURI | info:eu-repo/grantAgreement/FCT/5876/UID%2FCEC%2F04516%2F2013/PT | |
| oaire.awardURI | info:eu-repo/grantAgreement/FCT/3599-PPCDT/PTDC%2FCCI-COM%2F32166%2F2017/PT | |
| oaire.fundingStream | 5876 | |
| oaire.fundingStream | 3599-PPCDT | |
| project.funder.identifier | http://doi.org/10.13039/501100001871 | |
| project.funder.identifier | http://doi.org/10.13039/501100001871 | |
| project.funder.name | Fundação para a Ciência e a Tecnologia | |
| project.funder.name | Fundação para a Ciência e a Tecnologia | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | masterThesis | pt_PT |
| relation.isProjectOfPublication | 1f91d15d-5c38-4f20-87b3-0a1dfc82dcd9 | |
| relation.isProjectOfPublication | a8ac078f-8596-4b4c-bc12-56573e2eff6f | |
| relation.isProjectOfPublication.latestForDiscovery | a8ac078f-8596-4b4c-bc12-56573e2eff6f | |
| thesis.degree.name | Master of Science in Computer Science and Engineering | pt_PT |