In this paper we consider, compare and analyze three game theoretical Grid resource allocation mechanisms. Namely, 1) the non-cooperative sealed-bid method where tasks are auction...
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
Jorge G. Barbosa, C. N. Morais, R. Nobrega, A. P. ...
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
We present software tools that support robust input processing and comprehensive testing in Java. The software includes the JPT library that supports error-checked typed input via...
Query containment is the most fundamental relationship between a pair of database queries: a query Q is said to be contained in a query Q if the answer for Q is always a subset of...