Can one choose a good Huffman code on the fly, without knowing the underlying distribution? Online Slot Allocation (OSA) models this and similar problems: There are n slots, each with a known cost. There are n items. Requests for items are drawn i.i.d. from a fixed but hidden probability distribution p. After each request, if the item, i, was not previously requested, then the algorithm (knowin...

Using a novel stochastic programming (SP) formulation, we develop an algorithm for inventory control in industrial sized Assemble-To-Order (ATO) systems that has unparalleled efficiency and scalability. Applying our algorithm on several numerical examples, we generate new insights with respect to the control and optimization of these systems. We consider a continuous time model, seeking base-st...

First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web requests, and so on. We also have orthogonal applications of FCFS policies in proving correctness of search algorithms such as Breadth-First Search, the Bellman-Ford FIFO implementation for finding single-source shortest...

Grid computing can be considered large-scale distributed cluster and parallel network processing. The two most important issues in managing user work are resource allocation scheduling of required resources. When jobs submitted, they managed by intermediaries who find allocate the right After stage, scheduled on existing resources according to user's In grid systems with traditional scheduling,...

For the general G/G/1 processor sharing (PS) system a sample path result for the sojourn times in a busy period is proved, which yields a relation between the sojourn times under PS and FCFS discipline. In particular, the result provides a formula for the mean sojourn time in G/D/1-PS in terms of the mean sojourn time in the corresponding G/D/1-FCFS, generalizing known results for GI/M/1 and M/...

The schedulers of nonpreemptive batch processing systems are often based on the first-come first-serve (FCFS) or shortest-job-first (SJF) algorithms. The former is least discriminating in the sense that it does not base its scheduling decisions on the service requirements of jobs. In the SJF scheme, the service requirement of a job (or at least an estimate for it) must be known at the time of a...

In this letter, we investigate the impact of channel memory on average age information (AoI) for networks with various packet arrival models under first-come-first-served (FCFS) and preemptive last-generated-first-served (pLGFS) policies over Gilbert-Elliott (GE) erasure channel. For Bernoulli generate-at-will models, AoI performances FCFS pLGFS are derived explicitly as functions state transit...

This paper evaluates the performance of job scheduling schemes for pure space sharing among rigid jobs. Conventional job scheduling schemes for the pure space sharing among rigid jobs have been achieved by First Come First Served (FCFS). However, FCFS has a drawback such that it can not utilize processors e ciently. This paper evaluates the performance of job scheduling schemes that are propose...

The First-Come First-Served (FCFS) scheduling policy is the most popular algorithm used in practice. Furthermore, its usage theoretically validated: for light-tailed job size distributions, FCFS has weakly optimal asymptotic tail of response time. But what if we don't just care about tail? What also 99th percentile time, or fraction jobs that complete under one second? Is still best? Outside re...