Some NP-complete problems in quadratic and nonlinear programming
Mathematical Programming: Series A and B
Integer and combinatorial optimization
Integer and combinatorial optimization
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
Proceedings of the third international conference on Genetic algorithms
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Optimal VLSI architectural synthesis: area, performance and testability
Optimal VLSI architectural synthesis: area, performance and testability
Path-following methods for linear programming
SIAM Review
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on low-power design
Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm
Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
How to solve it: modern heuristics
How to solve it: modern heuristics
Journal of Parallel and Distributed Computing
Adaptive resource management algorithms for periodic tasks in dynamic real-time distributed systems
Journal of Parallel and Distributed Computing
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Computer Architecture: A Quantitative Approach
Computer Architecture: A Quantitative Approach
Energy efficiency and fairness tradeoffs in multi-resource, multi-tasking embedded systems
Proceedings of the 2003 international symposium on Low power electronics and design
Guaranteeing fault tolerance through scheduling in real-time systems
Guaranteeing fault tolerance through scheduling in real-time systems
Periodic Resource Model for Compositional Real-Time Guarantees
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Measuring the Robustness of a Resource Allocation
IEEE Transactions on Parallel and Distributed Systems
Resource Allocation for Periodic Applications in a Shipboard Environment
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
A Stochastic Approach to Measuring the Robustness of Resource Allocations in Distributed Systems
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Journal of Parallel and Distributed Computing
Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness
The Journal of Supercomputing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
A formal approach to the scheduling problem in high level synthesis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Robust resource allocation in a massive multiplayer online gaming environment
Proceedings of the 4th International Conference on Foundations of Digital Games
Robust resource allocation in a cluster based imaging system
Parallel Computing
Leveraging saving-based algorithms by master-slave genetic algorithms
Engineering Applications of Artificial Intelligence
Improving communication latency with the write-only architecture
Journal of Parallel and Distributed Computing
Parallel partitioning for distributed systems using sequential assignment
Journal of Parallel and Distributed Computing
Robust static resource allocation of DAGs in a heterogeneous multicore system
Journal of Parallel and Distributed Computing
Hi-index | 0.02 |
Providing efficient workload management is an important issue for a large-scale heterogeneous distributed computing environment where a set of periodic applications is executed. The considered shipboard distributed system is expected to operate in an environment where the input workload is likely to change unpredictably, possibly invalidating a resource allocation that was based on the initial workload estimate. The tasks consist of multiple strings, each made up of an ordered sequence of applications. There is a quality of service (QoS) minimum throughput constraint that must be satisfied for each application in a string, and a maximum utilization constraint that must be satisfied on each of the hardware resources in the system. The challenge, therefore, is to efficiently and robustly manage both computation and communication resources in this unpredictable environment to achieve high performance while satisfying the imposed constraints. This work addresses the problem of finding a robust initial allocation of resources to strings of applications that is able to absorb some level of unknown input workload increase without rescheduling. The proposed hybrid two-stage method of finding a near-optimal allocation of resources incorporates two specially designed mapping techniques: (1) the Permutation Space Genitor-Based heuristic, and (2) the follow-up Branch-and-Bound heuristic based on an Integer Linear Programming (ILP) problem formulation. The performance of the proposed resource allocation method is evaluated under different simulation scenarios and compared to an iteratively computed upper bound.