The wireless sensor network (WSN) is typically comprised many tiny nodes equipped with processors, sender/receiver antenna and limited battery in which it is impossible or not economic to recharge. Meanwhile, network lifespan is one of the most critical issues because of limited and not renewal used battery in WSN. Several mechanisms have been proposed to prolong network lifespan such as LEACH,...

We consider several scheduling problems for packet based systems with time-varying channel conditions. Designing scheduling mechanisms that take advantage of time-varying channel conditions, which are different for different users, is necessary to improve system performance; however this has to be done in a way that provides some level of fairness among the users. Such scheduling mechanisms are...

In dynamic environment of data grid effective job scheduling methods consider location of required data in dispatching jobs to resources. Also, job scheduling methods are combined with data replication mechanisms to reduce remote data access as well as save network bandwidth. In this paper, we combine job scheduling method and dynamic data replication to reduce data access delay and job executi...

We investigate cost-sharing mechanisms for scheduling cost-sharing games. We assume that the demand is general—that is, each player can be allocated one of several levels of service. We show how to design mechanisms for these games that are weakly group strategyproof, approximately budget-balanced, and approximately efficient, using approximation algorithms for the underlying scheduling problem...

Migrating functionality from software to hardware has historically held the promise of enhancing performance through exploiting the inherent parallel nature of hardware. Many early exploratory efforts in repartitioning traditional software based services into hardware were hampered by expensive ASIC development costs. Recent advancements in FPGA technology have made it more economically feasibl...

Hardware scheduling mechanisms are commonly used in current processors in order to make better use of instruction level parallelism. So far, such a mechanism is considered to be correct, if it avoids the standard structural and data hazards. However, based on two classical scheduling mechanisms, it will be shown that this condition is neither sufficient nor necessary for the correctness of such...

In general, synchronization mechanisms can be used to preserve dependence constraints in any nested loop, and can be combined with a loop scheduling scheme to form a uniform framework to obtain the correct execution order and balance workload distribution. Most current scheduling mechanisms cannot handle non-uniform dependence loops. In this paper, we propose a new combined scheduling scheme ca...