The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large comp...
Abstract. In this paper, we discuss on the extension of grid computing systems in mobile computing environments, where mobile devices can be effectively incorporated into the grid ...
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...