The allocation of students to courses is a widespread and repeated task in higher education, often accomplished by a simple first-come first-served (FCFS) procedure. FCFS is neither stable nor strategy-proof, however. The Nobel Prize in Economic Sciences was awarded to Al Roth and Lloyd Shapley for their work on the theory of stable allocations. This theory was influential in many areas, but fo...

We present an'exact delay analysis for a packet-switching concentrating system co,nsisting of an arbitrary number of active stations connected in tandem by unidirectional, asynchronous transmission lines, all with identical transmission rate. Packetized messages from exogenous sources enter the system at every station, are handled from station to station in a store-and-forward fashion, and exit...

Aircraft pushback management can make departure aircraft wait at the gate with engines off instead of waiting in queue before the runway with engines on, thus can reduce the fuel consumption. However, that can also cause delay the take-off time, which in turn reduces the capacity and passenger satisfaction. In view of this, this paper builds an non-cooperation game model for aircraft pushback s...

We study a class of scheduling problems, where each job is divided into a batch of unit-size tasks and these tasks can be executed in parallel on multiple servers with New-Better-than-Used (NBU) service time distributions. While many delay optimality results are available for single-server queueing systems, generalizing these results to the multi-server case has been challenging. This motivated...

The objective of grid computing is to distribute the jobs to heterogeneous environment and increase the speed of processing the jobs. Most of the Grid tool kits use the First Come First Served (FCFS) based scheduling algorithm to distribute the job to different executors or client nodes. In FCFS scheduling algorithm, doesn’t consider the capabilities of executors or client and also many process...

Packet scheduling disciplines play an important role in providing Quality of Service (QoS) guarantees to applications traffic in high speed networks. Several scheduling disciplines have emerged in the literature that are capable of providing guarantees on various QoS parameters, such as packet delay, jitter, loss and throughput, while maintaining fairness among various connections. However, the...

Campaign Scheduling is characterized by multiple job submissions issued from multiple users over time. This model perfectly suits today’s systems since most available parallel environments have multiple users sharing a common infrastructure. When scheduling individually the jobs submitted by various users, one crucial issue is to ensure fairness. This work presents a new fair scheduling algorit...

ÐMulticomputer systems achieve high performance by utilizing a number of computing nodes. Recently, by achieving significant reductions in communication delay, the three-dimensional (3D) torus has emerged as a new candidate interconnection topology for message-passing multicomputer systems. In this paper, we propose an efficient processor allocation schemeÐscan search schemeÐfor the 3D torus ba...

We consider the mean delay optimization in the M/G/1 queue for jobs with a service time distribution that has a tail with decreasing hazard rate (DHR). If the DHR property is valid for the whole distribution, then it is known that the Foreground-Background (FB) discipline, which gives priority to the job with least amount of attained service, is optimal among nonanticipating scheduling discipli...

We propose a Novel Fairness-Aware framework for Crowdsourcing Energy Services (FACES) to efficiently provision crowdsourced IoT energy services. Typically, efficient resource provisioning might incur an unfair sharing some requests. FACES, however, maximizes the utilization of available services by maximizing fairness across all conduct set preliminary experiments assess effectiveness proposed ...