We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
—Network coding for two-way relaying in a three-node network is considered. The achievable rate regions under both traditional four-slot multi-hopping (FSMH) and network coding (...
Abstract. An efficient optimum solution is presented for a real-life employee daysoff scheduling problem with a three-week cycle. Over a given work cycle, each worker is given 14 s...
We consider a class of component-based software models with interaction style of buffered asynchronous message passing between components with ports, represented by UML-RT. After ...
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...