We describe a framework for better understanding scheduling policies for fine-grained parallel computations and their effect on space usage. We define a profiling semantics that c...
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
— Dealing with RTTs (Round Trip Time) in IQ switches has been recently recognized as a challenging problem, especially if considering distributed (multi-chip) scheduler implement...
Alessandra Scicchitano, Andrea Bianco, Paolo Giacc...
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...