Share This Author
- Seif Haridi
- Computer ScienceLecture Notes in Computer Science
Apache Flink™: Stream and Batch Processing in a Single Engine
- Paris Carbone, Asterios Katsifodimos, Stephan Ewen, V. Markl, Seif Haridi, K. Tzoumas
- Computer ScienceIEEE Data Eng. Bull.
This paper discusses the approach to achieve high throughput for transactional query processing while allowing concurrent analytical queries, and presents its approach to distributed snapshot isolation and optimized two-phase commit protocols.
Concepts, Techniques, and Models of Computer Programming
This innovative text presents computer programming as a unified discipline in a way that is both practical and scientifically sound and allows programmer and student to grasp the underlying unity of programming.
DDM - A Cache-Only Memory Architecture
The Data Diffusion Machine (DDM), a cache-only memory architecture (COMA) that relies on a hierarchical network structure, is described and simulated performance results are presented.
Programming Paradigms of the Andorra Kernel Language
Although AKL is an instance of the previously introduced Kernel Andorra Prolog framework, this exposition contains important extensions, and a considerable amount of unnecessary formal overhead has been stripped away.
State Management in Apache Flink®: Consistent Stateful Distributed Stream Processing
- Paris Carbone, Stephan Ewen, Gyula Fóra, Seif Haridi, Stefan Richter, K. Tzoumas
- Computer ScienceProc. VLDB Endow.
- 1 August 2017
Flink's core pipelined, in-flight mechanism is presented which guarantees the creation of lightweight, consistent, distributed snapshots of application state, progressively, without impacting continuous execution, and the low performance trade-offs of the approach are demonstrated.
Efficient Broadcast in Structured P2P Networks
An efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks and considers broadcasting as a basic service that adds to existing DHTs the ability to search using arbitrary queries as well as dissiminate/collect global information.
DKS(N, k, f): a family of low communication, scalable and fault-tolerant infrastructures for P2P applications
- L. O. Alima, Sameh El-Ansary, P. Brand, Seif Haridi
- Computer ScienceCCGrid . 3rd IEEE/ACM International Symposium on…
- 12 May 2003
DKS(N, k, f), a family of infrastructures for building Peer-To-Peer applications, is presented, where there is no separate procedure for maintaining routing tables; instead, any out-of-date or erroneous routing entry is eventually corrected on-the-fly thereby, eliminating unnecessary bandwidth consumption.
JA-BE-JA: A Distributed Algorithm for Balanced Graph Partitioning
- F. Rahimian, Amir H. Payberah, Sarunas Girdzijauskas, M. Jelasity, Seif Haridi
- Computer ScienceIEEE 7th International Conference on Self…
- 9 September 2013
A thorough experimental analysis shows that the minimal edge-cut value achieved by JA-BE-JA is comparable to state-of-the-art centralized algorithms such as METIS, which makes JA- BE-JA-a bottom-up, self-organizing algorithm-a highly competitive practical solution for graph partitioning.