On the Problem of Over-clustering in Tuple-based Coordination Systems
- Manage
- Copy
- Actions
- Export
- Annotate
- Print Preview
Choose the export format from the list below:
- Office Formats (1)
-
Export as Portable Document Format (PDF) using the Web Browser
-
- Other Formats (2)
-
-
Export as HyperText Markup Language (HTML)
-
When it comes to communication performance, open distributed tuple-space systems depend heavily on the proximity of tuples to processes. Researchers have proposed many approaches for storing tuples in a way that processes benefit from the organization of tuples. Although some progress has been made, most of the proposed solutions fail to address the reverse problem: if most tuples are kept close to processes, the system's robustness is affected—the over-clustering of tuples in particular nodes creates a dependence on that particular node. Hence, we have a dichotomy where it is important to organize tuples in clusters close to processes, but it is equally important to avoid over-clustering. This paper presents a self-organized solution to the tuple distribution problem, in which the possibility of over-clustering is considered. |
Talks / Personal
Talks / Views
Home
— clouds
tags | speakers | authors
— per year
2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014–1992
— per sort
talks | invited talks | seminars | lectures | tutorials | project presentations | informal talks | internal talks | panel presentations | PhD presentations | poster presentations | other talks
Talk
— sort
— speakers
— language
where & when
— when
— context
URLs