Sciweavers

800 search results - page 2 / 160
» Understanding Algorithm Performance on an Oversubscribed Sch...
Sort
View
88
Voted
AAAI
2004
14 years 11 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...
AIPS
2006
14 years 11 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
AIPS
2008
14 years 12 months ago
Linear Relaxation Techniques for Task Management in Uncertain Settings
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably j...
Pradeep Varakantham, Stephen F. Smith
ANCS
2007
ACM
15 years 1 months ago
Congestion management for non-blocking clos networks
We propose a distributed congestion management scheme for non-blocking, 3-stage Clos networks, comprising plain buffered crossbar switches. VOQ requests are routed using multipath...
Nikolaos Chrysos
82
Voted
CLUSTER
2006
IEEE
14 years 9 months ago
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
Jiannong Cao, Alvin T. S. Chan, Yudong Sun, Sajal ...