In order to process massive amounts of streaming data in real time, high-performance computing systems and software platforms are being developed. However, the pool of available streaming applications is small and really large streaming applications are even more scarce. As such, there is a need for synthetic generators of task graphs for performance evaluation and comparative analysis of various algorithmic techniques and hardware parameters.
In this paper, we identify the key properties of stream-computing graphs that are shared by most (if not all) streaming graphs, irrespective of their specific application domain. We then propose a new approach to generate task graphs and show that the generated graphs satisfy the identified properties.
By: Deepak Ajwani; Shoukat Ali; John P. Morrison
Published in: RC25181 in 2011
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .