A class of contention-type MAC protocols (e.g., CSMA/CA) relies on random deferment of packet transmission, and subsumes a deferment selection strategy and a scheduling policy that determines the winner of each contention cycle. This paper examines contention-type protocols in a noncooperative an ad-hoc wireless LAN setting, where a number of stations self-optimise their strategies to obtain a ...

Open soft real-time systems, such as mobile robots, experience unpredictable interactions with their environments and yet must respond both adaptively and with reasonable temporal predictability. Because of the uncertainty inherent in such interactions, many of the assumptions of the real-time scheduling techniques traditionally used to ensure predictable timing of system actions do not hold in...

Tessellation is a manycore OS predicated on two central ideas: Space-Time Partitioning (STP) and Two-Level Scheduling. STP exploits novel hardware and software mechanisms to provide performance isolation and strong partitioning of resources (such as cores or memory bandwidth) among interacting software components, called “Cells”. Two-Level Scheduling separates global decisions about the allocat...

A study of scalable data intensive scheduling involving load distribution on multi-level fat tree networks is presented. It is shown that the speedup of processing divisible loads concurrently on a homogeneous single level tree increases linearly as the number of processors is increased. This behavior is markedly different from that of past research on sequential scheduling where speedup satura...

Fair scheduling or Fair Queueing (FQ) algorithms have received much attention in recent years because of their ability to provide a wide range of Quality-ofService (QoS) guarantees to end users. In this paper, we present a new analysis method that can statistically model such fair scheduling algorithms under Poisson arrivals and a general packet length distribution. We coin the new term M/G/FQ ...

electric power industry have always try to provide reliable electricity to customers and at the same time decrease system costs. high voltage circuit-breakers are an essential part of the power network. this study has developed a maintenance and replacement scheduling model for high voltage circuit- breakers that minimize maintenance costs while maintaining the acceptable reliability. this mode...

preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...

For parallel and distributed systems to gain wider acceptance than they have to date, they must become significantly easier to program. Fundamentally, parallel programming is more difficult than sequential programming as long as data and computation must be distributed by the programmer. Cache Only Memory Architectures (COMAs) provide a Distributed Shared Memory (DSM) where data distribution is...

With large-scale integration of distributed energy resources (DERs), distribution networks have turned into active distribution networks (ADNs). However, management risks and obstacles are caused by this in due to renewable energy generation (REG) forecasting errors. In this paper, a day-ahead active power scheduling method considering REG forecast errors is proposed to eliminate the risks, min...

For a large multi-hop wireless network, nodes are preferable to make distributed and localized link-scheduling decisions with only interactions among a small number of neighbors. However, for a slowly decaying channel and densely populated interferers, a small size neighborhood often results in nontrivial link outages and is thus insufficient for making optimal scheduling decisions. A question ...