Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors

Federated scheduling is a promising approach to schedule parallel real-time tasks on multi-cores, where each heavy task exclusively executes on a number of dedicated processors, while light tasks are treated as sequential sporadic tasks and share the remaining processors. However, federated scheduling suffers resource waste since a heavy task with processing capacity requirement $x + \epsilon$ (where $x$ is an integer and $0 < \epsilon < 1$) needs $x + 1$ dedicated processors. In the extreme case, almost half of the processing capacity is wasted. In this paper we propose the semi-federate scheduling approach, which only grants $x$ dedicated processors to a heavy task with processing capacity requirement $x + \epsilon$, and schedules the remaining $\epsilon$ part together with light tasks on shared processors. Experiments with randomly generated task sets show the semi-federated scheduling approach significantly outperforms not only federated scheduling, but also all existing approaches for scheduling parallel real-time tasks on multi-cores

Full Diversity Space-Time Block Codes with Low-Complexity Partial Interference Cancellation Group Decoding

Partial interference cancellation (PIC) group decoding proposed by Guo and Xia is an attractive low-complexity alternative to the optimal processing for multiple-input multiple-output (MIMO) wireless communications. It can well deal with the tradeoff among rate, diversity and complexity of space-time block codes (STBC). In this paper, a systematic design of full-diversity STBC with low-complexity PIC group decoding is proposed. The proposed code design is featured as a group-orthogonal STBC by replacing every element of an Alamouti code matrix with an elementary matrix composed of multiple diagonal layers of coded symbols. With the PIC group decoding and a particular grouping scheme, the proposed STBC can achieve full diversity, a rate of $(2M)/(M+2)$ and a low-complexity decoding for $M$ transmit antennas. Simulation results show that the proposed codes can achieve the full diversity with PIC group decoding while requiring half decoding complexity of the existing codes.Comment: 10 pages, 3 figures

On the Mutual Information in Conformal Field Theory

In this work, we study the universal behaviors in the mutual information of two disjoint spheres in a conformal field theory(CFT). By using the operator product expansion of the spherical twist operator in terms of the conformal family, we show that the large distance expansion of the mutual information can be cast in terms of the conformal blocks. We develop the $1/n$ prescription to compute the coefficients before the conformal blocks. For a single conformal family, the leading nonvanishing contribution to the mutual information comes from the bilinear operators. We show that the coefficients of these operators take universal forms and such universal behavior persists in the bilinear operators with derivatives as well. Consequently the first few leading order contributions to the mutual information in CFT take universal forms. To illustrate our framework, we discuss the free scalars and free fermions in various dimensions. For the free scalars, we compute the mutual information to the next-to-leading order and find good agreement with the improved numerical lattice result. For the free fermion, we compute the leading order result, which is of universal form, and find the good match with the numerical study. Our formalism could be applied to any CFT potentially.Comment: 27+14 pages, 8 figures; References adde