HTCondor MW

MW is a tool for making a master-worker style application that works in the distributed, opportunistic environment of HTCondor. MW applications use HTCondor as a resource management tool, and can use either HTCondor-PVM or MW-File a file-based, remote I/O scheme for message passing. Writing a parallel application for use in the HTCondor system can be a lot of work. Since the workers are not dedicated machines, they can leave the computation at any time. Machines can arrive at any time, too, and they can be suspended and resume computation. Machines can also be of varying architechtures and speeds. MW will handle all this variation and uncertainty in the opportunistic environment of HTCondor.

References in zbMATH (referenced in 28 articles )

Showing results 1 to 20 of 28.
Sorted by year (citations)

1 2 next

  1. Avis, David; Jordan, Charles: \textttmplrs: a scalable parallel vertex/facet enumeration code (2018)
  2. Shinano, Yuji; Heinz, Stefan; Vigerske, Stefan; Winkler, Michael: FiberSCIP -- a shared memory parallelization of SCIP (2018)
  3. Araújo, Aletéia P. F.; Boeres, Cristina; Rebello, Vinod E. F.; Ribeiro, Celso C.: A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications (2011)
  4. Siva Sathya, S.; Syam Babu, K.: Survey of fault tolerant techniques for grid (2010) ioport
  5. Linderoth, Jeff; Margot, François; Thain, Greg: Improving bounds on the football pool problem by integer programming and high-throughput computing (2009)
  6. Liu, Hao; Nazir, Amril; Sørensen, Søren-Aksel: Preliminary resource management for dynamic parallel applications in the grid (2009)
  7. Vocaturo, Francesca: Optimization via simulation for logistic systems planning and control (2009)
  8. Bendjoudi, A.; Guerdah, S.; Mansoura, M.; Melab, N.; Talbi, E.-G.: P2P B&B and GA for the flow-shop scheduling problem (2008)
  9. Dongarra, Jack; Pineau, Jean-François; Robert, Yves; Shi, Zhiao; Vivien, Frédéric: Revisiting matrix product on master-worker platforms (2008)
  10. Janjarassuk, Udom; Linderoth, Jeff: Reformulation and sampling to solve a stochastic network interdiction problem (2008)
  11. Ntaimo, Lewis; Sen, Suvrajeet: A comparative study of decomposition algorithms for stochastic combinatorial optimization (2008)
  12. Garg, Naveen; Kumar, Amit; Pandit, Vinayaka: Order scheduling models: Hardness and algorithms (2007)
  13. Nakajima, Yoshihiro; Sato, Mitsuhisa; Aida, Yoshiaki; Boku, Taisuke; Cappello, Franck: Integrating computing resources on multiple grid-enabled job scheduling systems through a grid RPC system (2007) ioport
  14. Battré, Dominic; Angulo, David Sigfredo: MPI framework for parallel searching in large biological databases (2006)
  15. Fourer, Robert; Lopes, Leo: A management system for decompositions in stochastic programming (2006)
  16. Fukuda, Munehiro; Kashiwagi, Koichi; Kobayashi, Shinya: AgentTeamwork: Coordinating grid-computing jobs with mobile agents (2006)
  17. Linderoth, Jeff; Shapiro, Alexander; Wright, Stephen: The empirical behavior of sampling methods for stochastic programming (2006)
  18. Melab, N.; Cahon, S.; Talbi, E-G.: Grid computing for parallel bioinspired algorithms (2006)
  19. Linderoth, Jeff: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (2005)
  20. Linderoth, Jeff; Wright, Stephen: Decomposition algorithms for stochastic programming on a computational grid (2003)

1 2 next

Further publications can be found at: