New Work Queue Paper at IEEE Cluster 2013

Michael Albrecht and Dinesh Rajan will present their latest work titled Making Work Queue Cluster Friendly for Data Intensive Scientific Applications .

In the original design of Work Queue, each worker was a sequential process that executed one task at a time. This paper describes the extension of Work Queue into two respects:

  • Workers can now run multiple tasks simultaneously, each sharing a local cache directory.
  • Workers can be combined into hierarchies, each headed by a foreman, which provides a common disk cache for each sub tree.


The effect of these two changes is to dramatically reduce the network footprint at the master process, and at each execution site. The resulting system is more ‘friendly’ to local clusters, and is capable of scaling to even greater sizes.




Enjoy Reading This Article?

Here are some more articles you might like to read next:

  • Kicking Off the New Semester: Welcome Andrés and Lab Updates
  • Shell Survival Skills: Terminal Tools Every HPC User Needs
  • How to Read HPC Error Logs (And What Common Failures Actually Mean)
  • Interactive Computing: Jupyter Notebooks and VS Code on Compute Nodes
  • SADE-SIM at FSE 2026