MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters

DOI10.1007/978-3-642-41036-9_9zbMath1407.68346OpenAlexW125191722MaRDI QIDQ5168515

Carlo Bellettini, Matteo Camilli, Mattia Monga, Lorenzo Capra

Publication date: 7 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-41036-9_9

zbMATH Keywords

formal methodsdistributed computingbig datacloud computingMapReducereachability graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Internet topics (68M11)

Related Items (1)

MaRDiGraS

Uses Software

• GreatSPN
• Hadoop
• PIPE2
• Twister

This page was built for publication: MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters