Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,098,305 papers from all fields of science
Search
Sign In
Create Free Account
Hazelcast
In computing, Hazelcast is an open source in-memory data grid based on Java. It is also the name of the company developing the product. The Hazelcast…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
28 relations
CloudSim
Complex event processing
Computer cluster
Database
Expand
Broader (1)
Transaction processing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
IRIS-HiSA: Highly Scalable and Available Carrier-Grade SDN Controller Cluster
Jisoo Shin
,
Taehong Kim
,
Byungjoon Lee
,
Sunhee Yang
Journal on spesial topics in mobile networks and…
2017
Corpus ID: 3869828
As software defined networking (SDN) extends its applications to carrier-grade networks, the need for high scalability and…
Expand
2017
2017
An Adaptive and Flexible Replication Mechanism for Space-based Computing
Stefan Craß
,
Jürgen Hirsch
,
E. Kühn
,
Vesna Šešum-Čavić
International Conference on Software and Data…
2017
Corpus ID: 10031393
The highly dynamic nature of the Internet implies necessity for advanced communication paradigms. Large modern networks exchange…
Expand
2017
2017
Open Source In-Memory Data Grid Systems: Benchmarking Hazelcast and Infinispan
Haytham Salhi
,
Feras Odeh
,
Rabee Nasser
,
A. Taweel
International Conference on Performance…
2017
Corpus ID: 8237751
Distributed cache systems are used to store and retrieve frequently used data for faster access by exploiting the memory of more…
Expand
2017
2017
Fault Tolerance for Cooperative Lifeline-Based Global Load Balancing in Java with APGAS and Hazelcast
Jonas Posner
,
Claudia Fohry
IEEE International Symposium on Parallel…
2017
Corpus ID: 8713737
Fault tolerance is a major issue for parallel applications. Approaches on application-level are gaining increasing attention…
Expand
2017
2017
Benchmarking and Performance Analysis for Distributed Cache Systems: A Comparative Case Study
Haytham Salhi
,
Feras Odeh
,
Rabee Nasser
,
A. Taweel
TPC Technology Conference
2017
Corpus ID: 433039
Caching critical pieces of information in memory or local hard drive is important for applications’ performance. Critical pieces…
Expand
2016
2016
Automated design of a parallel distributed system for streaming data processing
D. Titov
,
A. Doroshenko
,
O. Yatsenko
International Conference Radio Electronics & Info…
2016
Corpus ID: 36583529
The development of high-level algebra-algorithmic tools for automated parallel program design for a distributed dynamically…
Expand
2015
2015
Asynchronous Complete Garbage Collection for Graph Data Stores
L. Veiga
,
R. Bruno
,
P. Ferreira
International Middleware Conference
2015
Corpus ID: 8093688
Graph data stores are a popular choice for a number of applications: social networks, recommendation systems, authorization and…
Expand
2014
2014
Scalar: Systematic Scalability Analysis with the Universal Scalability Law
Thomas Heyman
,
Davy Preuveneers
,
W. Joosen
International Conference on Future Internet of…
2014
Corpus ID: 15756822
Analyzing the scalability and quality of service of large scale distributed systems requires a highly scalable benchmarking…
Expand
2014
2014
Asynchronous Logging and Fast Recovery for a Large-Scale Distributed In-Memory Storage
Kevin Beineke
,
F. Klein
,
M. Schöttner
GI-Jahrestagung
2014
Corpus ID: 11729807
Large-scale interactive applications and online graph analytic processing require very fast data access to many small data…
Expand
2012
2012
In-Memory Data Grid technology and its implementation
K. Czajkowski
,
D. Pezda
2012
Corpus ID: 61322600
The article discusses the issues of In-Memory Data Grid as one of the possible approaches to the data management. The various…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE