We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
Abstract--Scheduling algorithm for batch-mode dataintensive jobs is a key issue in data-intensive Grid applications. It focuses on how to minimize the overhead of transferring the ...
Jianhua Jiang, Huifang Ji, Gaochao Xu, Xiaohui Wei
One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time const...
In the trilateration of wireless sensor networks, to overcome the affection of localization error caused by the selection of beacon nodes, a selective strategy of beacon nodes bas...
Wen-yuan Liu, En-shuang Wang, Zi-jun Chen, Lin Wan...