In this paper we propose a model to predict the performance of synchronous discrete event simulation. The model considers parameters including the number of active objects per cyc...
We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and indep...
—This paper proposes a cooperative space-time coding (STC) protocol, amalgamating the concepts of asynchronous cooperation, non-coherent detection as well as Distributed Turbo Co...
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
—In current cooperative communication schemes, to achieve cooperative diversity, synchronization between terminals is usually assumed, which may not be practical since each termi...