Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Stream processor architecture
Aurora: a new model and architecture for data stream management
The VLDB Journal — The International Journal on Very Large Data Bases
StreamGen: A Workload Generation Tool for Distributed Information Flow Applications
ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
SWORD: scalable and flexible workload generator for distributed data processing systems
Proceedings of the 38th conference on Winter simulation
Linear road: a stream data management benchmark
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
SPADE: the system s declarative stream processing engine
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Distributed multi-layered workload synthesis for testing stream processing systems
Proceedings of the 40th Conference on Winter Simulation
Language and compiler support for stream programs
Language and compiler support for stream programs
Random graph generation for scheduling simulations
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
Workload characterization for operator-based distributed stream processing applications
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Proceedings of the 19th international conference on Parallel architectures and compilation techniques
Tracking Structure of Streaming Social Networks
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
QR Factorization on a Multicore Node Enhanced with Multiple GPU Accelerators
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
A Flexible Workload Generator for Simulating Stream Computing Systems
MASCOTS '11 Proceedings of the 2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems
Efficient and simple generation of random simple connected graphs with prescribed degree sequence
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Graph Partitioning for Reconfigurable Topology
IPDPS '12 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium
| Hi-index | 0.00 |
Stream-computing is an emerging computational model for performing complex operations on and across multi-source, high-volume data flows. The pool of mature publicly available applications employing this model is fairly small, and therefore the availability of workloads for various types of applications is scarce. Thus, there is a need for synthetic generation of large-scale workloads to drive simulations and estimate the performance of stream-computing applications at scale. We identify the key properties shared by most task graphs of stream-computing applications and use them to extend known random graph generation concepts with stream computing specific features, providing researchers with realistic input stream graphs. Our graph generation techniques serve the purpose of covering a disparity of potential applications and user input. Our first ''domain-specific'' framework exhibits high user-controlled configurability while the second ''application-agnostic'' framework focuses solely on emulating the key properties of general stream-computing systems, at the loss of domain-specific fine-tuning.