Tomáš Faltín

Tomáš Faltín

I'm a computer systems researcher and Assistant Professor at Charles University, focused on building and analyzing high-performance, scalable software. My core research investigates large-scale distributed graph processing and the underlying performance mechanics of concurrent systems through rigorous analysis and benchmarking. I bring industry and academic experience from my past work at Oracle Labs and Inria Paris.

Projects

I’m always looking for motivated students and collaborators interested in Performance Critical Systems, more specifically in distributed and parallel systems, big data (graph) processing, or operating systems. If you’d like to work on a Bachelor’s, Master’s, or Ph.D. thesis, or collaborate on a research project leading to a publication, feel free to contact me. You can either choose from the proposed topics below or suggest your own idea as long as it aligns with my research areas.

I’m also in contact with people from industry (e.g., Oracle Labs) and research institutions (e.g., Inria Paris), so I can help connect students with opportunities for research or industry internships in these fields.

Research Interests

  • Big Data Processing
    e.g., large-scale graph analytics, streaming systems

  • Graph Analytics
    e.g., analytics of social networks using graphs

  • Distributed and Parallel Data Processing Systems
    e.g., consensus protocols, fault tolerance

  • Blockchain
    e.g., bitcoin, ethereum, blockchain protocols

  • Operating Systems
    e.g., scheduling algorithms, resource management, virtualization

Proposed Research Projects

Below are some potential topics for collaboration, project or thesis work. Each project is designed to lead to a publishable research paper:

Efficient (Graph) Processing on Modern Distributed Systems:

  1. on blockchain
  2. on disagregated systems
  3. using a learned-index
  4. using data-mining techniques
  5. using worst-case-optimal-join …

Efficient Tracing of Synchronization Primitives

Continuation of work of our tool Tapestry. We trace and visualize synchronization primitives, such as blocking (e.g, futex) and busy-waiting (e.g., spinloops) .

Operating System Scheduler Benchmark

Design and evaluate a benchmark for (Linux) scheduler.

Assigned Projects

Efficient graph Processing using CRDTs

Improve the standard CSR using CRDTs.

Efficient Disaggregated Heterogeneous Architecture for Graph Processing

Create a disaggregated architecture that can be easily used by various graph processing engines.

Blochchain Simulator

A simulator that simulates and visualizes various blockchain algorithms.