We present a new wireless scheduling algorithm based on the cumulative distribution function (cdf) of user transmission rates and also present a simple modification of it to limit the maximum starving time. This cdf-based scheduling (CS) algorithm selects the user for transmission based on the cdf of user rates in such a way that the user whose rate is high enough but least probable to become h...

Multi-thread polling (MTP) with offline scheduling and offline excess bandwidth distribution has recently been proposed to overcome the long propagation delay of long-reach passive optical networks (LR-PONs). In this paper, we propose a complementary MTP approach with online scheduling and online excess bandwidth distribution. We evaluate the throughput-delay performance of offline and online M...

In this work, we consider the problem of scheduling under uncertainty where the uncertain problem parameters can be described by a known probability distribution function. A novel robust optimization methodology, originally proposed by Lin, Janak, and Floudas [Lin, X., Janak, S. L., & Floudas, C. A. (2004). A new robust optimization approach for scheduling under uncertainty: I. Bounded uncertai...

In a supply chain, cross-docking is one of the most innovative systems for ameliorating the operational performance at distribution centers. Cross-docking is a logistics strategy in which freight is unloaded from inbound trucks and (almost) directly loaded into outbound trucks, with little or no storage in between, thus no inventory remains at the distribution center. In this study, we consider...

A distributed system is a collection of independent computers that appears to its users as a single coherent system. Depending on job arrival rate some of the computing nodes may become overloaded while some other nodes may sit idle. The imbalance in load distribution may affect overall system performance. So proper task scheduling algorithm is needed. Real time task scheduling algorithm must t...

We consider a class of discrete time bulk-service queues with buffer of infinite size where requests can be serviced in batches of given fixed sizes only. We provide techniques to obtain the steady state distribution of such queues for a general arrival process. Such queues arise out of the problem of power efficient packet scheduling in a communication system with discrete rates. Analysis of t...

We investigate the problem of scheduling of file distribution from Road-Side Units (RSUs) to vehicles in an urban environment. We suppose one RSU exist in each cross-road and all RSUs are connected to each other through a high speed backbone. Since the number of vehicles as well as the number and size of files are potentially large, scalable scheduling is a challenge. We first chop each file in...

Self-scheduling algorithms are useful tools for achieving load balance in computational systems, in particular, in computational Grids. In this work, we introduce two families of self-scheduling algorithms. The first is defined by methods looking for an explicit form for the chunks distribution function. The second corresponds to methods focusing in derive an explicit form for the rate of varia...

The Progressive Edge Growth (PEG) algorithm is one of the most widely-used methods for constructing finite length LDPC codes. In this paper we consider the PEG algorithm together with a scheduling distribution, which specifies the order in which edges are established in the graph. The goal is to find a scheduling distribution that yields “the best” performance in terms of decoding overhead, per...