Ceriel J. H. Jacobs
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ceriel J. H. Jacobs has a total of 103 co-authors. Here are the top co-authors by number of shared publications:
- Henri E. Bal
Vrije Universiteit Amsterdam, Amsterdam, Netherlands
16 shared publications Dick Grune
Vrije Universiteit, 1081 HV, Netherlands
7 shared publications- Jason Maassen
VU University, Amsterdam, Netherlands
6 shared publications Jacopo Urbani
Vrije Universiteit Amsterdam Amsterdam The Netherlands
4 shared publicationsThilo Kielmann
Vrije Universitieit , Amsterdam
4 shared publications- Jacopo Urbani
Vrije Universiteit Amsterdam
3 shared publications
Latest Publications
- Open Access
- 20 April 2020
- Published by Association for Computing Machinery (ACM)
- p. 1761-1772
Adaptive Low-level Storage of Very Large Knowledge Graphs
The increasing availability and usage of Knowledge Graphs (KGs) on the Web calls for scalable and general-purpose solutions to store this type of data structures. We propose Trident, a novel storage architecture for very large KGs on centralized systems. Trident uses several interlinked data structures to provide fast access to nodes and edges, with the physical storage changing depending on the topology of the graph to reduce the memory footprint. In contrast to single architectures designed for single tasks, our approach offers an interface with few low-level and general-purpose primitives that can be used to implement tasks like SPARQL query answering, reasoning, or graph analytics. Our experiments show that Trident can handle graphs with 1011 edges using inexpensive hardware, delivering competitive performance on multiple workloads.
- 20 April 2020
- Published by Association for Computing Machinery (ACM)
- p. 1761-1772
Open AccessAdaptive Low-level Storage of Very Large Knowledge Graphs
The increasing availability and usage of Knowledge Graphs (KGs) on the Web calls for scalable and general-purpose solutions to store this type of data structures. We propose Trident, a novel storage architecture for very large KGs on centralized systems. Trident uses several interlinked data structures to provide fast access to nodes and edges, with the physical storage changing depending on the topology of the graph to reduce the memory footprint. In contrast to single architectures designed for single tasks, our approach offers an interface with few low-level and general-purpose primitives that can be used to implement tasks like SPARQL query answering, reasoning, or graph analytics. Our experiments show that Trident can handle graphs with 1011 edges using inexpensive hardware, delivering competitive performance on multiple workloads.
- Open Access
- 1 December 2018
- Published by Elsevier in Digital Investigation
- Vol. 27, 3-16
A Jungle Computing approach to common image source identification in large collections of images
- 1 December 2018
- Published by Elsevier in Digital Investigation
- Vol. 27, 3-16
Open AccessA Jungle Computing approach to common image source identification in large collections of images
- 30 June 2018
- Published by Springer Nature
- p. 680-688
Efficient Model Construction for Horn Logic with VLog
- 30 June 2018
- Published by Springer Nature
- p. 680-688
Efficient Model Construction for Horn Logic with VLog
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 135-145
Cashmere: Heterogeneous Many-Core Computing
New generations of many-core hardware become available frequently and are typically attractive extensions for data-centers because of power-consumption and performance benefits. As a result, supercomputers and clusters are becoming heterogeneous and start to contain a variety of many-core devices. Obtaining performance from a homogeneous cluster-computer is already challenging, but achieving it from a heterogeneous cluster is even more demanding. Related work primarily focuses on homogeneous many-core clusters. In this paper we present Cashmere, a programming system for heterogeneous many-core clusters. Cashmere is a tight integration of two existing systems: Satin is a programming system that provides a divide- and-conquer programming model with automatic load-balancing and latency-hiding, while Many-Core Levels is a programming system that provides a powerful methodology to optimize computational kernels for varying types of many-core hardware. We evaluate our system with several classes of applications and show that Cashmere achieves high performance and good scalability. The efficiency of heterogeneous executions is comparable to the homogeneous runs and is >90% in three out of four applications.
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 135-145
Cashmere: Heterogeneous Many-Core Computing
New generations of many-core hardware become available frequently and are typically attractive extensions for data-centers because of power-consumption and performance benefits. As a result, supercomputers and clusters are becoming heterogeneous and start to contain a variety of many-core devices. Obtaining performance from a homogeneous cluster-computer is already challenging, but achieving it from a heterogeneous cluster is even more demanding. Related work primarily focuses on homogeneous many-core clusters. In this paper we present Cashmere, a programming system for heterogeneous many-core clusters. Cashmere is a tight integration of two existing systems: Satin is a programming system that provides a divide- and-conquer programming model with automatic load-balancing and latency-hiding, while Many-Core Levels is a programming system that provides a powerful methodology to optimize computational kernels for varying types of many-core hardware. We evaluate our system with several classes of applications and show that Cashmere achieves high performance and good scalability. The efficiency of heterogeneous executions is comparable to the homogeneous runs and is >90% in three out of four applications.
- 27 January 2015
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 27 (17) , 4515-4554
Stepwise‐refinement for performance: a methodology for many‐core programming
Summary: Many‐core hardware is targeted specifically at obtaining high performance, but reaching high performance is often challenging because hardware‐specific details have to be taken into account. Although there are many programming systems that try to alleviate many‐core programming, some providing a high‐level language, others providing a low‐level language for control, none of these systems have a clear and systematic methodology as a foundation. In this article, we proposestepwise‐refinement for performance: a novel, clear, and structured methodology for obtaining high performance on many‐cores. We present a system that supports this methodology, offers multiple levels of abstraction to provide programmers a trade‐off between high‐level and low‐level programming, and provides programmers detailed performance feedback. We evaluate our methodology with several widely varying compute kernels on two different many‐core architectures: a Graphical Processing Unit (GPU) and the Xeon Phi. We show that our methodology gives insight in the performance, and that in almost all cases, we gain a substantial performance improvement using our methodology. Copyright © 2015 John Wiley & Sons, Ltd.
- 27 January 2015
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 27 (17) , 4515-4554
Stepwise‐refinement for performance: a methodology for many‐core programming
Summary: Many‐core hardware is targeted specifically at obtaining high performance, but reaching high performance is often challenging because hardware‐specific details have to be taken into account. Although there are many programming systems that try to alleviate many‐core programming, some providing a high‐level language, others providing a low‐level language for control, none of these systems have a clear and systematic methodology as a foundation. In this article, we proposestepwise‐refinement for performance: a novel, clear, and structured methodology for obtaining high performance on many‐cores. We present a system that supports this methodology, offers multiple levels of abstraction to provide programmers a trade‐off between high‐level and low‐level programming, and provides programmers detailed performance feedback. We evaluate our methodology with several widely varying compute kernels on two different many‐core architectures: a Graphical Processing Unit (GPU) and the Xeon Phi. We show that our methodology gives insight in the performance, and that in almost all cases, we gain a substantial performance improvement using our methodology. Copyright © 2015 John Wiley & Sons, Ltd.
- 1 January 2015
- Published by Springer Nature
- p. 125-138
RDF-SQ: Mixing Parallel and Sequential Computation for Top-Down OWL RL Inference
- 1 January 2015
- Published by Springer Nature
- p. 125-138
RDF-SQ: Mixing Parallel and Sequential Computation for Top-Down OWL RL Inference
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636927,p. 545-554
AJIRA: A Lightweight Distributed Middleware for MapReduce and Stream Processing
Currently, MapReduce is the most popular programming model for large-scale data processing and this motivated the research community to improve its efficiency either with new extensions, algorithmic optimizations, or hardware. In this paper we address two main limitations of MapReduce: one relates to the model's limited expressiveness, which prevents the implementation of complex programs that require multiple steps or iterations. The other relates to the efficiency of its most popular implementations (e.g., Hadoop), which provide good resource utilization only for massive volumes of input, operating sub optimally for smaller or rapidly changing input. To address these limitations, we present AJIRA, a new middleware designed for efficient and generic data processing. At a conceptual level, AJIRA replaces the traditional map/reduce primitives by generic operators that can be dynamically allocated, allowing the execution of more complex batch and stream processing jobs. At a more technical level, AJIRA adopts a distributed, multi-threaded architecture that strives at minimizing overhead for non-critical functionality. These characteristics allow AJIRA to be used as a single programming model for both batch and stream processing. To this end, we evaluated its performance against Hadoop, Spark, Esper, and Storm, which are state of the art systems for both batch and stream processing. Our evaluation shows that AJIRA is competitive in a wide range of scenarios both in terms of processing time and scalability, making it an ideal choice where flexibility, extensibility, and the processing of both large and dynamic data with a single programming model are either desirable or even mandatory requirements.
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636927,p. 545-554
AJIRA: A Lightweight Distributed Middleware for MapReduce and Stream Processing
Currently, MapReduce is the most popular programming model for large-scale data processing and this motivated the research community to improve its efficiency either with new extensions, algorithmic optimizations, or hardware. In this paper we address two main limitations of MapReduce: one relates to the model's limited expressiveness, which prevents the implementation of complex programs that require multiple steps or iterations. The other relates to the efficiency of its most popular implementations (e.g., Hadoop), which provide good resource utilization only for massive volumes of input, operating sub optimally for smaller or rapidly changing input. To address these limitations, we present AJIRA, a new middleware designed for efficient and generic data processing. At a conceptual level, AJIRA replaces the traditional map/reduce primitives by generic operators that can be dynamically allocated, allowing the execution of more complex batch and stream processing jobs. At a more technical level, AJIRA adopts a distributed, multi-threaded architecture that strives at minimizing overhead for non-critical functionality. These characteristics allow AJIRA to be used as a single programming model for both batch and stream processing. To this end, we evaluated its performance against Hadoop, Spark, Esper, and Storm, which are state of the art systems for both batch and stream processing. Our evaluation shows that AJIRA is competitive in a wide range of scenarios both in terms of processing time and scalability, making it an ideal choice where flexibility, extensibility, and the processing of both large and dynamic data with a single programming model are either desirable or even mandatory requirements.
- 1 January 2013
- Published by Springer Nature
- p. 657-672
DynamiTE: Parallel Materialization of Dynamic RDF Data
- 1 January 2013
- Published by Springer Nature
- p. 657-672
DynamiTE: Parallel Materialization of Dynamic RDF Data
- 1 January 2012
- Published by Elsevier in Parallel Computing
- Vol. 38 (1-2) , 75-89
Generating synchronization statements in divide-and-conquer programs
- 1 January 2012
- Published by Elsevier in Parallel Computing
- Vol. 38 (1-2) , 75-89
Generating synchronization statements in divide-and-conquer programs