2009
Contribution to conference
Open Access
XtreemOS, an Open-source Grid operating system targeting the future internet
Carlini E., Coppola M., Laforenza D.
Source: III Conferenza Italiana sul Software Libero, Bologna, 2009
Carlini E., Coppola M., Laforenza D.
Source: III Conferenza Italiana sul Software Libero, Bologna, 2009
See at:
ISTI Repository 
| CNR ExploRA
2017
Dataset
Unknown
Data used for submission entitled "A Spatial Analysis Of Multiplayer Online Battle Arena Mobility Traces"
Carlini E., Lulli A.
A mobility trace dataset for the popular Multiplayer Online Battle Arena game "Heroes of Newerth"
Carlini E., Lulli A.
A mobility trace dataset for the popular Multiplayer Online Battle Arena game "Heroes of Newerth"
See at: CNR ExploRA | zenodo.org
2019
Contribution to conference
Open Access
Proceedings of the 15th International Conference on the Economics of Grids, Clouds, Systems, and Services (GECON 2018)
Coppola M., Carlini E., D'Agostino D., Altmann J., Banares J. A.
Welcome message for the 15th International Conference on the Economics of Grids, Clouds, Systems, and Services (GECON 2018).DOI: 10.1007/978-3-030-13342-9
DOI: 10.1007/978-3-642-35194-5
Metrics:
Coppola M., Carlini E., D'Agostino D., Altmann J., Banares J. A.
Welcome message for the 15th International Conference on the Economics of Grids, Clouds, Systems, and Services (GECON 2018).DOI: 10.1007/978-3-030-13342-9
DOI: 10.1007/978-3-642-35194-5
Metrics:
See at:
ISTI Repository | link.springer.com 
| link.springer.com | link.springer.com | link.springer.com | link.springer.com | CNR ExploRA
2020
Contribution to journal
Closed Access
Special Issue on High Performance Services Computing and Internet Technologies
Tserpes K., Dazzi P., Carlini E., Coppola M., Zissis D.
Source: Future generation computer systems 109 (2020): 642–643. doi:10.1016/j.future.2020.04.017
DOI: 10.1016/j.future.2020.04.017
Metrics:
Tserpes K., Dazzi P., Carlini E., Coppola M., Zissis D.
Source: Future generation computer systems 109 (2020): 642–643. doi:10.1016/j.future.2020.04.017
DOI: 10.1016/j.future.2020.04.017
Metrics:
See at:
Future Generation Computer Systems | www.sciencedirect.com | CNR ExploRA
2016
Contribution to journal
Open Access
Reliably Estimating Adherence to Therapy in Chronic Patients from Italian Administrative Databases
Gini R., Schuemie M. J., Pasqua A., Dazzi P., Carlini E., Cricelli I., Barletta V., Francesconi P., Profili F., Lapi F., Donatini A., Dal Co G., Cricelli C., Bellentani M., Sturkenboom M., Klazinga N.
Source: Pharmacoepidemiology and drug safety 25 (2016): 185–186. doi:10.1002/pds.4070
DOI: 10.1002/pds.4070
Metrics:
Gini R., Schuemie M. J., Pasqua A., Dazzi P., Carlini E., Cricelli I., Barletta V., Francesconi P., Profili F., Lapi F., Donatini A., Dal Co G., Cricelli C., Bellentani M., Sturkenboom M., Klazinga N.
Source: Pharmacoepidemiology and drug safety 25 (2016): 185–186. doi:10.1002/pds.4070
DOI: 10.1002/pds.4070
Metrics:
See at:
Pharmacoepidemiology and Drug Safety | onlinelibrary.wiley.com | ISTI Repository | Pharmacoepidemiology and Drug Safety | CNR ExploRA
2019
Contribution to book
Open Access
Area of interest management in massively multiplayer online games
Ricci L., Carlini E.
In a Massively Multiplayer Online Game, the Area-Of-Interest (AOI) is that portion of the virtual world of specific interest for a player.Source: Encyclopedia of Computer Graphics and Games, edited by Newton Lee, 2019
DOI: 10.1007/978-3-319-08234-9_239-1
Metrics:
Ricci L., Carlini E.
In a Massively Multiplayer Online Game, the Area-Of-Interest (AOI) is that portion of the virtual world of specific interest for a player.Source: Encyclopedia of Computer Graphics and Games, edited by Newton Lee, 2019
DOI: 10.1007/978-3-319-08234-9_239-1
Metrics:
See at:
link.springer.com | ISTI Repository | link.springer.com | CNR ExploRA
2015
Journal article
Open Access
Layered thinking in vertex centric computations
Carlini E., Dazzi P., Lulli A., Ricci L.
The Telos framework eases the transition to a vertex-centric approach in the high performance and distributed programming of BigData analytics targeting large graphs. Telos represents a paradigm shift, from "think like a vertex" to "think like a network".Source: ERCIM news 102 (2015): 31–32.
Carlini E., Dazzi P., Lulli A., Ricci L.
The Telos framework eases the transition to a vertex-centric approach in the high performance and distributed programming of BigData analytics targeting large graphs. Telos represents a paradigm shift, from "think like a vertex" to "think like a network".Source: ERCIM news 102 (2015): 31–32.
See at:
ercim-news.ercim.eu | CNR ExploRA
2021
Report
Open Access
D6.3 ACCORDION system implementation (I)
Carlini E., Vailati A., Rola J., Ferrucci L., Kavalionak H., Tserpes K., Ferrann D.
This document covers the implementation activities put in place in the ACCORDION consortium to enable a smooth integration of the distributed ACCORDION platform. The first part of the document describes the three core components of the platform, while the second part describes the first integration testing performed on such components.Source: ISTI Project report, ACCORDION, D6.3, 2021
Project(s): ACCORDION
Carlini E., Vailati A., Rola J., Ferrucci L., Kavalionak H., Tserpes K., Ferrann D.
This document covers the implementation activities put in place in the ACCORDION consortium to enable a smooth integration of the distributed ACCORDION platform. The first part of the document describes the three core components of the platform, while the second part describes the first integration testing performed on such components.Source: ISTI Project report, ACCORDION, D6.3, 2021
Project(s): ACCORDION
See at:
ISTI Repository | CNR ExploRA
2011
Conference article
Restricted
Probabilistic dropping in push and pull dissemination over distributed hash tables
Carlini E., Coppola M, Ricci L.
Dynamic information management via Distributed Hash Tables (DHT) is an important problem which revolves around the trade-off between data freshness and the overhead due to information updates. We propose two different algorithms based on information pull and information push models, that enable dynamic information dissemination with low overhead over a DHT. We exploit the concept of popularity of specific items, which is evaluated by performing a real-time analysis of the query distribution, and allows to decrease a significant fraction of messages without impairing the query resolution process. We have measured the overhead savings and compared the performance of the two approaches by extensive simulations using real workload traces.Source: The 11th IEEE International Conference on Computer and Information Technology, CIT 2011, pp. 47–52, Pafos, Cyprus, 31 August - 2 September 2011
DOI: 10.1109/cit.2011.94
Project(s): CONTRAIL
Metrics:
Carlini E., Coppola M, Ricci L.
Dynamic information management via Distributed Hash Tables (DHT) is an important problem which revolves around the trade-off between data freshness and the overhead due to information updates. We propose two different algorithms based on information pull and information push models, that enable dynamic information dissemination with low overhead over a DHT. We exploit the concept of popularity of specific items, which is evaluated by performing a real-time analysis of the query distribution, and allows to decrease a significant fraction of messages without impairing the query resolution process. We have measured the overhead savings and compared the performance of the two approaches by extensive simulations using real workload traces.Source: The 11th IEEE International Conference on Computer and Information Technology, CIT 2011, pp. 47–52, Pafos, Cyprus, 31 August - 2 September 2011
DOI: 10.1109/cit.2011.94
Project(s): CONTRAIL
Metrics:
See at:
doi.org | ieeexplore.ieee.org | CNR ExploRA
2012
Contribution to conference
Restricted
Reducing Server Load in MMOG via P2P Gossip.
Carlini E., Ricci L., Coppola M.
A fundamental problem for the development of Massively Multiplayer Online Games (MMOGs) is the definition of a mechanism supporting interest management, i.e. determining all the entities of the virtual world that are relevant for a given peer. To this end, we propose a hybrid architecture combining centralized and P2P solutions. Our proposal exploits a P2P gossip-based approach supporting a best-effort resolution of interest management, so that it can be mostly supported through the P2P overlay, with minimal intervention of a centralized entity.Source: The 11th Annual Workshop on Network and Systems Support for Games, pp. 2–2, Venezia, Italy, 22-23 November 2012
DOI: 10.1109/netgames.2012.6404015
Project(s): CONTRAIL
Metrics:
Carlini E., Ricci L., Coppola M.
A fundamental problem for the development of Massively Multiplayer Online Games (MMOGs) is the definition of a mechanism supporting interest management, i.e. determining all the entities of the virtual world that are relevant for a given peer. To this end, we propose a hybrid architecture combining centralized and P2P solutions. Our proposal exploits a P2P gossip-based approach supporting a best-effort resolution of interest management, so that it can be mostly supported through the P2P overlay, with minimal intervention of a centralized entity.Source: The 11th Annual Workshop on Network and Systems Support for Games, pp. 2–2, Venezia, Italy, 22-23 November 2012
DOI: 10.1109/netgames.2012.6404015
Project(s): CONTRAIL
Metrics:
See at:
doi.org | CNR ExploRA
2013
Journal article
Restricted
Flexible load distribution for hybrid distributed virtual environments
Carlini E., Ricci L., Coppola M.
This paper proposes an architecture for Distributed Virtual Environment (DVE) integrating cloud and peer nodes. We define the overall structure of the architecture and propose a flexible strategy to distribute the load due to the management of the entities of the DVE. The proposed approach takes into account the utilization of the nodes, the economical cost due to their use of bandwidth, and their probability failure. A greedy heuristics is exploited to reduce the computational cost of the algorithm in order to maintain a fair interactivity level to the end user of the DVE. A mobility model generating realistic Second Life traces is exploited to evaluate our algorithm. The experimental results show the effectiveness of our approach.Source: Future generation computer systems 29 (2013): 1561–1572. doi:10.1016/j.future.2012.09.004
DOI: 10.1016/j.future.2012.09.004
Project(s): CONTRAIL
Metrics:
Carlini E., Ricci L., Coppola M.
This paper proposes an architecture for Distributed Virtual Environment (DVE) integrating cloud and peer nodes. We define the overall structure of the architecture and propose a flexible strategy to distribute the load due to the management of the entities of the DVE. The proposed approach takes into account the utilization of the nodes, the economical cost due to their use of bandwidth, and their probability failure. A greedy heuristics is exploited to reduce the computational cost of the algorithm in order to maintain a fair interactivity level to the end user of the DVE. A mobility model generating realistic Second Life traces is exploited to evaluate our algorithm. The experimental results show the effectiveness of our approach.Source: Future generation computer systems 29 (2013): 1561–1572. doi:10.1016/j.future.2012.09.004
DOI: 10.1016/j.future.2012.09.004
Project(s): CONTRAIL
Metrics:
See at:
Future Generation Computer Systems | www.sciencedirect.com | CNR ExploRA
2014
Contribution to book
Open Access
Toward community-driven interest management for distributed virtual environment
Carlini E., Dazzi P., Mordacchini M., Ricci L.
A fundamental requirement for the discovery and the re- trieval of the entities of a distributed virtual environment is the definition of a scalable Interest Management (IM) support. This paper presents a distributed protocol for IM that integrates two different gossip protocols. The first one based on a discrete tessellation of the Area of Interest of a peer in order to maximise its coverage by the peer neighbours. The second is based on a distributed algorithm enabling the peers to self-organise themselves in communities. The paper presents a set of experimental results showing the effectiveness of the proposed approach.Source: Euro-Par 2013: Parallel Processing Workshops, edited by Dieter an Mey, Michael Alexander, Paolo Bientinesi (et al...), pp. 363–373, 2014
DOI: 10.1007/978-3-642-54420-0_36
Project(s): CONTRAIL
Metrics:
Carlini E., Dazzi P., Mordacchini M., Ricci L.
A fundamental requirement for the discovery and the re- trieval of the entities of a distributed virtual environment is the definition of a scalable Interest Management (IM) support. This paper presents a distributed protocol for IM that integrates two different gossip protocols. The first one based on a discrete tessellation of the Area of Interest of a peer in order to maximise its coverage by the peer neighbours. The second is based on a distributed algorithm enabling the peers to self-organise themselves in communities. The paper presents a set of experimental results showing the effectiveness of the proposed approach.Source: Euro-Par 2013: Parallel Processing Workshops, edited by Dieter an Mey, Michael Alexander, Paolo Bientinesi (et al...), pp. 363–373, 2014
DOI: 10.1007/978-3-642-54420-0_36
Project(s): CONTRAIL
Metrics:
See at:
link.springer.com | doi.org | link.springer.com | CNR ExploRA
2015
Contribution to book
Open Access
Community discovery for interest management in DVEs: A case study
Carlini E., Dazzi P., Mordacchini M., Lulli A., Ricci L.
An efficient interest management is a fundamental requirement to support Distributed Virtual Environments (DVEs). As avatars move across the virtual environment, they often forming communities by gathering around hotspots. Distributed community discovery is a research area that gained momentum in the last years. In this paper we propose a case study evaluation on the impact of communities and community discovery on a distributed gossip-based interest management architecture for DVEs. Our experimental evaluation shows that communities have a positive impacts on interest management, at the expense of a small computational and communication overheadSource: Euro-Par 2015 International Workshops, pp. 273–285, 2015
DOI: 10.1007/978-3-319-27308-2_23
Metrics:
Carlini E., Dazzi P., Mordacchini M., Lulli A., Ricci L.
An efficient interest management is a fundamental requirement to support Distributed Virtual Environments (DVEs). As avatars move across the virtual environment, they often forming communities by gathering around hotspots. Distributed community discovery is a research area that gained momentum in the last years. In this paper we propose a case study evaluation on the impact of communities and community discovery on a distributed gossip-based interest management architecture for DVEs. Our experimental evaluation shows that communities have a positive impacts on interest management, at the expense of a small computational and communication overheadSource: Euro-Par 2015 International Workshops, pp. 273–285, 2015
DOI: 10.1007/978-3-319-27308-2_23
Metrics:
See at:
link.springer.com | doi.org | link.springer.com | CNR ExploRA
2015
Contribution to book
Open Access
A multi-layer framework for graph processing via overlay composition
Lulli A., Dazzi P., Ricci L., Carlini E.
The processing of graph in a parallel and distributed fashion is a constantly rising trend, due to the size of the today's graphs. This paper proposes a multi-layer graph overlay approach to support the orchestration of distributed, vertex-centric computations targeting large graphs. Our approach takes inspiration from the overlay networks, a widely exploited approach for information dissemination, aggregation and computing orchestration in massively distributed systems. We propose Telos, an environment supporting the definition of multi-layer graph overlays which provides each vertex with a layered, vertex-centric, view of the graph. Telos is defined on the top of Apache Spark and has been evaluated by considering two well-known graph problems. We present a set of experimental results showing the effectiveness of our approach.Source: Euro-Par 2015: Parallel Processing Workshops, pp. 515–527, 2015
DOI: 10.1007/978-3-319-27308-2_42
Metrics:
Lulli A., Dazzi P., Ricci L., Carlini E.
The processing of graph in a parallel and distributed fashion is a constantly rising trend, due to the size of the today's graphs. This paper proposes a multi-layer graph overlay approach to support the orchestration of distributed, vertex-centric computations targeting large graphs. Our approach takes inspiration from the overlay networks, a widely exploited approach for information dissemination, aggregation and computing orchestration in massively distributed systems. We propose Telos, an environment supporting the definition of multi-layer graph overlays which provides each vertex with a layered, vertex-centric, view of the graph. Telos is defined on the top of Apache Spark and has been evaluated by considering two well-known graph problems. We present a set of experimental results showing the effectiveness of our approach.Source: Euro-Par 2015: Parallel Processing Workshops, pp. 515–527, 2015
DOI: 10.1007/978-3-319-27308-2_42
Metrics:
See at:
link.springer.com | doi.org | link.springer.com | CNR ExploRA
2016
Conference article
Open Access
An holistic approach for high-level programming of next-generation data-intensive applications targeting distributed heterogeneous computing environment
Carlini E., Dazzi P., Mordacchini M.
Data-intensive applications are one of the largest customers of high throughput computing environments. As clearly shown by the BigData raise, there is a widely recognised urge for processing large amount of data, universallyconsidered the "new oil", from which to extract wisdom, knowledge and, more in general, information of very different kinds, ranging from commercial to financial, from medical to political hints. This extreme intrinsic richness andheterogeneity of data is paired with the extreme complexity in its storing and processing.Source: Cf 2016 - Cloud Forward Conference, pp. 131–134, Madrid, Spain, 18-20/10/2016
DOI: 10.1016/j.procs.2016.08.290
Project(s): BASMATI
Metrics:
Carlini E., Dazzi P., Mordacchini M.
Data-intensive applications are one of the largest customers of high throughput computing environments. As clearly shown by the BigData raise, there is a widely recognised urge for processing large amount of data, universallyconsidered the "new oil", from which to extract wisdom, knowledge and, more in general, information of very different kinds, ranging from commercial to financial, from medical to political hints. This extreme intrinsic richness andheterogeneity of data is paired with the extreme complexity in its storing and processing.Source: Cf 2016 - Cloud Forward Conference, pp. 131–134, Madrid, Spain, 18-20/10/2016
DOI: 10.1016/j.procs.2016.08.290
Project(s): BASMATI
Metrics:
See at:
Procedia Computer Science | www.sciencedirect.com | CNR ExploRA
2016
Report
Open Access
Challenges to be addressed for realising an ephemeral cloud federation
Carlini E., Coppola M., Dazzi P., Mordacchini M.
This paper sketches the challenges to address to realise a support able to achieve an Ephemeral Cloud Federation, an innovative cloud computing paradigm that enables the exploitation of a dynamic, personalised and context-aware set of resources. The aim of the Ephemeral Federation is to answer to the need of combining private data-centres with both federation of cloud providers and the resource on the edge of the network. The goal of the Ephemeral Federation is to deliver a context-aware and personalised federations of computational, data and network resources, able to manage their heterogeneity in a highly distributed deployment, which can dynamically bring data and computation close to the final user.Source: ISTI Technical reports, 2016
Carlini E., Coppola M., Dazzi P., Mordacchini M.
This paper sketches the challenges to address to realise a support able to achieve an Ephemeral Cloud Federation, an innovative cloud computing paradigm that enables the exploitation of a dynamic, personalised and context-aware set of resources. The aim of the Ephemeral Federation is to answer to the need of combining private data-centres with both federation of cloud providers and the resource on the edge of the network. The goal of the Ephemeral Federation is to deliver a context-aware and personalised federations of computational, data and network resources, able to manage their heterogeneity in a highly distributed deployment, which can dynamically bring data and computation close to the final user.Source: ISTI Technical reports, 2016
See at:
ISTI Repository | CNR ExploRA
2016
Conference article
Restricted
Static and dynamic big data partitioning on apache spark
Bertolucci M., Carlini E., Dazzi P., Lulli A., Ricci L.
Many of today's large datasets are organized as a graph. Due to their size it is often infeasible to process these graphs using a single machine. Therefore, many software frameworks and tools have been proposed to process graph on top of distributed infrastructures. This software is often bundled with generic data decomposition strategies that are not optimised for specific algorithms. In this paper we study how a specific data partitioning strategy affects the performances of graph algorithms executing on Apache Spark. To this end, we implemented different graph algorithms and we compared their performances using a naive partitioning solution against more elaborate strategies, both static and dynamic.Source: International Conference on Parallel Computing, pp. 489–498, Edinburgh, Scotland, 1-4 September 2015
DOI: 10.3233/978-1-61499-621-7-489
Metrics:
Bertolucci M., Carlini E., Dazzi P., Lulli A., Ricci L.
Many of today's large datasets are organized as a graph. Due to their size it is often infeasible to process these graphs using a single machine. Therefore, many software frameworks and tools have been proposed to process graph on top of distributed infrastructures. This software is often bundled with generic data decomposition strategies that are not optimised for specific algorithms. In this paper we study how a specific data partitioning strategy affects the performances of graph algorithms executing on Apache Spark. To this end, we implemented different graph algorithms and we compared their performances using a naive partitioning solution against more elaborate strategies, both static and dynamic.Source: International Conference on Parallel Computing, pp. 489–498, Edinburgh, Scotland, 1-4 September 2015
DOI: 10.3233/978-1-61499-621-7-489
Metrics:
See at:
ebooks.iospress.nl | CNR ExploRA
2016
Conference article
Unknown
BASMATI-a brokerage architecture on federated clouds for mobile applications
Altmann J., Carlini E., Coppola M., Dazzi P., Juan Ferrer A., Haile N., Jung Y-W., Kang D-J., Marshall I-J., Tserpes K., Varvarigou T.
Although mobile devices became more powerful and sophisticated over the last decade, enabling rich-multimedia services, resource constraints still hinder today's mobile applications from reaching their potential. To address this, this work aims at delivering an architecture that supports changing needs of mobile users through an end-to-end approach. The outcomes are sets of requirements, each representing a set of prioritized platform functionalities, and the BASMATI architecture that integrates the sets.Source: CGW 2016 International Workshop, Krakov, Poland, 24/10/2016
Project(s): BASMATI
Altmann J., Carlini E., Coppola M., Dazzi P., Juan Ferrer A., Haile N., Jung Y-W., Kang D-J., Marshall I-J., Tserpes K., Varvarigou T.
Although mobile devices became more powerful and sophisticated over the last decade, enabling rich-multimedia services, resource constraints still hinder today's mobile applications from reaching their potential. To address this, this work aims at delivering an architecture that supports changing needs of mobile users through an end-to-end approach. The outcomes are sets of requirements, each representing a set of prioritized platform functionalities, and the BASMATI architecture that integrates the sets.Source: CGW 2016 International Workshop, Krakov, Poland, 24/10/2016
Project(s): BASMATI
See at: CNR ExploRA
2017
Conference article
Restricted
Dynamic resource selection in cloud service broker
Santoso G. Z., Jung Y. -W., Seok S. -W., Carlini E., Dazzi P., Altmann J., Violos J., Marshall J.
Cloud Service Broker federates multiple Cloud Service Providers into a single entity to customers. The benefits that can be enjoyed by Cloud Service Consumer are flexibility, ease of use, and reduced cost. However, because of the unique properties and configurations of each cloud provider, sometime it's not easy to migrate between one cloud provider to another. Furthermore, the advantage of using broker should be obtained by consumers in any life cycle of consumer's software not only during the deployment of the software. This paper outlines the main idea and design of the dynamic resource selection in BASMATI Cloud Federation.Source: HPCS 2017 - International Conference on High Performance Computing & Simulation, pp. 233–235, Genoa, Italy, 17-21 July 2017
DOI: 10.1109/hpcs.2017.43
Metrics:
Santoso G. Z., Jung Y. -W., Seok S. -W., Carlini E., Dazzi P., Altmann J., Violos J., Marshall J.
Cloud Service Broker federates multiple Cloud Service Providers into a single entity to customers. The benefits that can be enjoyed by Cloud Service Consumer are flexibility, ease of use, and reduced cost. However, because of the unique properties and configurations of each cloud provider, sometime it's not easy to migrate between one cloud provider to another. Furthermore, the advantage of using broker should be obtained by consumers in any life cycle of consumer's software not only during the deployment of the software. This paper outlines the main idea and design of the dynamic resource selection in BASMATI Cloud Federation.Source: HPCS 2017 - International Conference on High Performance Computing & Simulation, pp. 233–235, Genoa, Italy, 17-21 July 2017
DOI: 10.1109/hpcs.2017.43
Metrics:
See at:
doi.org | ieeexplore.ieee.org | CNR ExploRA
2018
Contribution to book
Open Access
BASMATI: Cloud Brokerage Across Borders for Mobile Users and Applications
Carlini E., Coppola M., Dazzi P., Tserpes K., Violos J., Jung Y. W., Santoso G. Z., Altmann J., Marshall J., Pages E., Kim M.
BASMATI aims at delivering an integrated platform that will support the dynamic needs of mobile applications and users through an end-to-end approach for cloud services. BASMATI will emphasize on enabling runtime adaptation of all assets, including user and application prediction models, federation patterns, resources and data management policies, brokerage and offloading decisions. BASMATI platform will coordinate all assets to react in response to real-world events in real-time.Source: Advances in Service-Oriented and Cloud Computing Workshops of ESOCC 2017, Oslo, Norway, September 27-29, 2017, Revised Selected Papers, edited by Zoltán Ádám Mann, Volker Stolz, pp. 181–186, 2018
DOI: 10.1007/978-3-319-79090-9_16
Project(s): BASMATI
Metrics:
Carlini E., Coppola M., Dazzi P., Tserpes K., Violos J., Jung Y. W., Santoso G. Z., Altmann J., Marshall J., Pages E., Kim M.
BASMATI aims at delivering an integrated platform that will support the dynamic needs of mobile applications and users through an end-to-end approach for cloud services. BASMATI will emphasize on enabling runtime adaptation of all assets, including user and application prediction models, federation patterns, resources and data management policies, brokerage and offloading decisions. BASMATI platform will coordinate all assets to react in response to real-world events in real-time.Source: Advances in Service-Oriented and Cloud Computing Workshops of ESOCC 2017, Oslo, Norway, September 27-29, 2017, Revised Selected Papers, edited by Zoltán Ádám Mann, Volker Stolz, pp. 181–186, 2018
DOI: 10.1007/978-3-319-79090-9_16
Project(s): BASMATI
Metrics:
See at:
ISTI Repository | Communications in Computer and Information Science | link.springer.com | CNR ExploRA