Change search
Link to record
Permanent link

Direct link
BETA
Publications (10 of 96) Show all publications
Meldrum, M., Segeljakt, K., Kroll, L., Carbone, P., Schulte, C. & Haridi, S. (2019). Arcon: Continuous and deep data stream analytics. In: ACM International Conference Proceeding Series: . Paper presented at 13th International Workshop on Real-Time Business Intelligence and Analytics, BIRTE 2019, in conjunction with the VLDB 2019 Conference, 26 August 2019. Association for Computing Machinery
Open this publication in new window or tab >>Arcon: Continuous and deep data stream analytics
Show others...
2019 (English)In: ACM International Conference Proceeding Series, Association for Computing Machinery , 2019Conference paper, Published paper (Refereed)
Abstract [en]

Contemporary end-to-end data pipelines need to combine many diverse workloads such as machine learning, relational operations, stream dataflows, tensor transformations, and graphs. For each of these workload types, there exists several frontends (e.g., SQL, Beam, Keras) based on different programming languages as well as different runtimes (e.g., Spark, Flink, Tensorflow) that optimize for a particular frontend and possibly a hardware architecture (e.g., GPUs). The resulting pipelines suffer in terms of complexity and performance due to excessive type conversions, materialization of intermediate results, and lack of cross-framework optimizations. Arcon aims to provide a unified approach to declare and execute tasks across frontend-boundaries as well as enabling their seamless integration with event-driven services at scale. In this demonstration, we present Arcon and through a series of use-case scenarios demonstrate that its execution model is powerful enough to cover existing as well as upcoming real-time computations for analytics and application-specific needs. © 2019 Copyright held by the owner/author(s).

Place, publisher, year, edition, pages
Association for Computing Machinery, 2019
Keywords
Data flow analysis, Information analysis, Object oriented programming, Program processors, Application specific, Framework optimization, Hardware architecture, Intermediate results, Real-time computations, Relational operations, Seamless integration, Tensor transformation, Pipelines
National Category
Natural Sciences
Identifiers
urn:nbn:se:ri:diva-40454 (URN)10.1145/3350489.3350492 (DOI)2-s2.0-85072806432 (Scopus ID)9781450376600 (ISBN)
Conference
13th International Workshop on Real-Time Business Intelligence and Analytics, BIRTE 2019, in conjunction with the VLDB 2019 Conference, 26 August 2019
Available from: 2019-10-15 Created: 2019-10-15 Last updated: 2019-10-15Bibliographically approved
Rahimian, F., Girdzijauskas, S. & Haridi, S. (2014). Parallel Community Detection For Cross-Document Coreference (6ed.). Kista, Sweden: Swedish Institute of Computer Science
Open this publication in new window or tab >>Parallel Community Detection For Cross-Document Coreference
2014 (English)Report (Other academic)
Abstract [en]

This document presents a highly parallel solution for cross-document coreference resolution, which can deal with billions of documents that exist in the current web. At the core of our solution lies a novel algorithm for community detection in large scale graphs. We operate on graphs which we construct by representing documents' keywords as nodes and the co-location of those keywords in a document as edges. We then exploit the particular nature of such graphs where coreferent words are topologically clustered and can be efficiently discovered by our community detection algorithm. The accuracy of our technique is considerably higher than that of the state of the art, while the convergence time is by far shorter. In particular, we increase the accuracy for a baseline dataset by more than 15\% compared to the best reported result so far. Moreover, we outperform the best reported result for a dataset provided for the Word Sense Induction task in SemEval 2010.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science, 2014 Edition: 6
Series
SICS Technical Report, ISSN 1100-3154 ; 2014:01
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24302 (URN)
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-08-20Bibliographically approved
Rahimian, F., Payberah, A., Girdzijauskas, S., Jelasity, M. & Haridi, S. (2013). Ja-be-Ja: A Distributed Algorithm for Balanced Graph Partitioning (7ed.). Kista, Sweden: Swedish Institute of Computer Science
Open this publication in new window or tab >>Ja-be-Ja: A Distributed Algorithm for Balanced Graph Partitioning
Show others...
2013 (English)Report (Other academic)
Abstract [en]

Balanced graph partitioning is a well known NP-complete problem with a wide range of applications. These applications include many large-scale distributed problems such as the optimal storage of large sets of graph-structured data over several hosts, or identifying clusters in on-line social networks. In such very large-scale distributed scenarios, state-of-the-art algorithms are not directly applicable, because they typically involve frequent global operations over the entire graph. In this paper, we propose a distributed graph partitioning algorithm, called Ja-be-Ja1. The algorithm is massively parallel: each graph node is processed independently, and only the direct neighbors of the node, and a small subset of random nodes in the graph need to be known. Strict synchronization is not required. These features allow Ja-be-Ja to be easily adapted to any distributed graph-processing system from data centers to fully distributed networks. We perform a thorough experimental analysis, which shows that the minimal edge-cut value achieved by Ja-be-Ja is comparable to state-of-the-art centralized algorithms such as Metis. In particular, on large social networks Ja-be-Ja outperforms Metis.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science, 2013 Edition: 7
Series
SICS Technical Report, ISSN 1100-3154 ; 2013:03
Keywords
graph partitioning, distributed algorithm, load balancing
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24165 (URN)
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2019-06-28Bibliographically approved
Arad, C., Shafaat, T. M. & Haridi, S. (2012). Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value Stores (10ed.). In: : . Paper presented at Proceedings of 26th International Symposium on Distributed Computing (DISC), Brazil, (pp. 445-446). Springer, 7611
Open this publication in new window or tab >>Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value Stores
2012 (English)Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Springer, 2012 Edition: 10
Series
Lecture Notes in Computer Science
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24108 (URN)
Conference
Proceedings of 26th International Symposium on Distributed Computing (DISC), Brazil,
Projects
CNS
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-08-20Bibliographically approved
Arad, C., Shafaat, T. M. & Haridi, S. (2012). CATS: linearizability and partition tolerance in scalable and self-organizing key-value stores (7ed.). Kista, Sweden: Swedish Institute of Computer Science
Open this publication in new window or tab >>CATS: linearizability and partition tolerance in scalable and self-organizing key-value stores
2012 (English)Report (Other academic)
Abstract [en]

Distributed key-value stores provide scalable, fault-tolerant, and self-organizing storage services, but fall short of guaranteeing linearizable consistency in partially synchronous, lossy, partitionable, and dynamic networks, when data is distributed and replicated automatically by the principle of consistent hashing. This paper introduces consistent quorums as a solution for achieving atomic consistency. We present the design and implementation of CATS, a distributed key-value store which uses consistent quorums to guarantee linearizability and partition tolerance in such adverse and dynamic network conditions. CATS is scalable, elastic, and self-organizing; key properties for modern cloud storage middleware. Our system shows that consistency can be achieved with practical performance and modest throughput overhead (5%) for read-intensive workloads.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science, 2012 Edition: 7
Series
SICS Technical Report, ISSN 1100-3154 ; 2012:04
Keywords
atomic consistency, partition tolerance, scalability, self-organization, elasticity, fault tolerance, dynamic reconfiguration, distributed key-value stores
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24030 (URN)
Projects
REST
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-08-20Bibliographically approved
Shafaat, T. M., Ghodsi, A. & Haridi, S. (2012). Dealing with Bootstrapping, Maintenance, and Network Partitions and Mergers in Structured Overlay Networks (9ed.). In: : . Paper presented at Proceedings of 6th IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO), France (pp. 149-158). IEEE Computer Society
Open this publication in new window or tab >>Dealing with Bootstrapping, Maintenance, and Network Partitions and Mergers in Structured Overlay Networks
2012 (English)Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
IEEE Computer Society, 2012 Edition: 9
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24107 (URN)
Conference
Proceedings of 6th IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO), France
Projects
CNS
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-08-20Bibliographically approved
Reale, R., Roverso, R., El-Ansary, S. & Haridi, S. (2012). DTL: Dynamic Transport Library for Peer-to-Peer Applications. (11ed.). In: : . Paper presented at ICDCN (pp. 428-442). Springer, 7129
Open this publication in new window or tab >>DTL: Dynamic Transport Library for Peer-to-Peer Applications.
2012 (English)Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Springer, 2012 Edition: 11
Series
Lecture Notes in Computer Science
Keywords
dblp
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24115 (URN)
Conference
ICDCN
Projects
CNS
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-08-20Bibliographically approved
Drejhammar, F. & Haridi, S. (2012). Efficient simulation of view synchrony (6ed.). Kista, Sweden: Swedish Institute of Computer Science
Open this publication in new window or tab >>Efficient simulation of view synchrony
2012 (English)Report (Other academic)
Abstract [en]

This report presents an algorithm for efficiently simulating view synchrony, including failure-atomic total-order multicast in a discrete-time event simulator. In this report we show how a view synchrony implementation tailored to a simulated environment removes the need for third party middleware and detailed network simulation, thus reducing the complexity of a test environment. An additional advantage is that simulated view synchrony can generate all timing behaviours allowed by the model instead of just those exhibited by a particular view synchrony implementation.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science, 2012 Edition: 6
Series
SICS Technical Report, ISSN 1100-3154 ; 2012:07
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24039 (URN)
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2019-06-20Bibliographically approved
Shafaat, T. M., Ahmad, B. & Haridi, S. (2012). ID-Replication for Structured Peer-to-Peer Systems (11ed.). In: : . Paper presented at Proceedings of the 18th International European Conference on Parallel and Distributed Computing (Euro-Par), Greece (pp. 364-376). Springer, 7484
Open this publication in new window or tab >>ID-Replication for Structured Peer-to-Peer Systems
2012 (English)Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Springer, 2012 Edition: 11
Series
Lecture Notes in Computer Science
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24106 (URN)
Conference
Proceedings of the 18th International European Conference on Parallel and Distributed Computing (Euro-Par), Greece
Projects
CNS
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-08-20Bibliographically approved
Roverso, R., El-Ansary, S. & Haridi, S. (2012). Peer2View: A peer-to-peer HTTP-live streaming platform (10ed.). In: : . Paper presented at Peer-to-Peer Computing (P2P), 2012 IEEE 12th International Conference on (pp. 65-66).
Open this publication in new window or tab >>Peer2View: A peer-to-peer HTTP-live streaming platform
2012 (English)Conference paper, Published paper (Refereed)
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24116 (URN)
Conference
Peer-to-Peer Computing (P2P), 2012 IEEE 12th International Conference on
Projects
CNS
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-08-20Bibliographically approved
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-6718-0144

Search in DiVA

Show all publications
v. 2.35.7