2017
DOI: 10.1145/3039207
|View full text |Cite
|
Sign up to set email alerts
|

SPL

Abstract: Big data is revolutionizing how all sectors of our economy do business, including telecommunication, transportation, medical, and finance. Big data comes in two flavors: data at rest and data in motion. Processing data in motion is stream processing. Stream processing for big data analytics often requires scale that can only be delivered by a distributed system, exploiting parallelism on many hosts and many cores. One such distributed stream processing system is IBM Streams. Early customer experience with IBM … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 17 publications
(4 citation statements)
references
References 78 publications
0
4
0
Order By: Relevance
“…Our implementation does not directly use SIMD instructions, but the C++ optimizing compiler sometimes uses them automatically. We did not implement partitioning but it is straightforward: when the aggregate is partitioned by key, keep disjoint state, i.e., a separate tree for each key; that would enable fission [12] for parallelization, either user-directed or automatically. Previous work describes an algorithm for range queries [22], and that algorithm also works in the presence of bulk insertion and eviction.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Our implementation does not directly use SIMD instructions, but the C++ optimizing compiler sometimes uses them automatically. We did not implement partitioning but it is straightforward: when the aggregate is partitioned by key, keep disjoint state, i.e., a separate tree for each key; that would enable fission [12] for parallelization, either user-directed or automatically. Previous work describes an algorithm for range queries [22], and that algorithm also works in the presence of bulk insertion and eviction.…”
Section: Methodsmentioning
confidence: 99%
“…In theory, we expect that since the data is in-order, bulk insert brings no additional advantage over looping over single inserts. In practice, all algorithms improve in throughput as 𝑚 increases from 2 0 to around 2 12 . This may be because fewer top-level insertions means fewer memory fences, even for algorithms that emulate bulk insert with loops.…”
Section: Throughputmentioning
confidence: 96%
“…Architectural models [42], SPEs [43,13], and engines for certain application scenarios such as IoT are emerging. Architecture that mixes elements deployed on edge computing resources and the cloud is provided in the literature [43,44,42].…”
Section: Second: Distributed Executionmentioning
confidence: 99%
“…Stream Processing Language (SPL) offers a language and engine for composing distributed and parallel data-flow graphs and a toolkit for building generic operators [44]. It provides language constructs and compiler optimisations that utilise the performance of the Stream Processing Core (SPC) [68].…”
Section: Other Solutionsmentioning
confidence: 99%