Mark Sims
Mark Sims has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Arnold L. Rosenberg
Colorado State University
1 shared publication - Daniel Corkill
Department of Computer Science, University of Massachusetts, Amherst, MA 01003, USA
1 shared publication - Gennaro Cordasco
University of Salerno
1 shared publication - Victor Lesser
University of Massachusetts
1 shared publication
Latest Publications
- Open Access
- 1 January 2011
- Published by Walter de Gruyter GmbH in Open Computer Science
- Vol. 1 (1)
On clustering DAGs for task-hungry computing platforms
Many modern computing platforms are “task-hungry”: their performance is enhanced by always having as many tasks available for execution as possible. IC-scheduling, a master-worker framework for executing static computations that have intertask dependencies (modeled as dags), was developed with precisely the goal of rendering a computation-dag’s tasks eligible for execution at the maximum possible rate. The current paper addresses the problem of enhancing IC-scheduling so that it can accommodate the varying computational resources of different workers, by clustering a computation-dag’s tasks, while still producing eligible (now, clustered) tasks at the maximum possible rate. The task-clustering strategies presented exploit the structure of the computation being performed, ranging from a strategy that works for any dag, to ones that build increasingly on the explicit structure of the dagbeing scheduled.
- 1 January 2011
- Published by Walter de Gruyter GmbH in Open Computer Science
- Vol. 1 (1)
Open AccessOn clustering DAGs for task-hungry computing platforms
Many modern computing platforms are “task-hungry”: their performance is enhanced by always having as many tasks available for execution as possible. IC-scheduling, a master-worker framework for executing static computations that have intertask dependencies (modeled as dags), was developed with precisely the goal of rendering a computation-dag’s tasks eligible for execution at the maximum possible rate. The current paper addresses the problem of enhancing IC-scheduling so that it can accommodate the varying computational resources of different workers, by clustering a computation-dag’s tasks, while still producing eligible (now, clustered) tasks at the maximum possible rate. The task-clustering strategies presented exploit the structure of the computation being performed, ranging from a strategy that works for any dag, to ones that build increasingly on the explicit structure of the dagbeing scheduled.
- 15 December 2007
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 16 (2) , 151-185
Automated organization design for multi-agent systems
- 15 December 2007
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 16 (2) , 151-185
Automated organization design for multi-agent systems