Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Rate-optimal schedule for multi-rate DSP computations
Journal of VLSI Signal Processing Systems - Special issue on application-specific array processors
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Scheduling Parallel Computations
Journal of the ACM (JACM)
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Journal of VLSI Signal Processing Systems
Grid Computing: Making the Global Infrastructure a Reality
Grid Computing: Making the Global Infrastructure a Reality
TransLight: a global-scale LambdaGrid for e-science
Communications of the ACM - Blueprint for the future of high-performance networking
Data-intensive e-science frontier research
Communications of the ACM - Blueprint for the future of high-performance networking
Distributed and collaborative visualization of large data sets using high-speed networks
Future Generation Computer Systems - IGrid 2005: The global lambda integrated facility
Efficient computation of buffer capacities for multi-rate real-time systems with back-pressure
CODES+ISSS '06 Proceedings of the 4th international conference on Hardware/software codesign and system synthesis
Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs
IEEE Transactions on Computers
DRAGON: a framework for service provisioning in heterogeneous grid networks
IEEE Communications Magazine
| Hi-index | 0.00 |
We develop a novel framework for supporting e-Science applications that require streaming of information between sites. Using a Synchronous Dataflow (SDF) model, our framework incorporates the communication times inherent in large scale distributed applications, and can be used to formulate the bandwidth allocation problem with throughput constraints as a multi-commodity linear programming problem. Our algorithms determine how much bandwidth is allocated to each edge while satisfying temporal constraints on collaborative tasks. Simulation results show that the bandwidth allocation by the formulated linear programming outperforms the bandwidth allocation by simple heuristics.