Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The traditional message-passing schedule consists of updating all the variable nodes in the graph, using the same pre-update information, followed by updating all the check nodes of the graph, again, using the same pre-update info...

We consider the problem of scheduling static task graphs by using Cilk, a C-based runtime system for multithreaded parallel programming. We assume no pre-emption of task execution and no prior knowledge of the task execution times. Given a task graph G, the output of the scheduling algorithm is a Cilk program P which, when executed, initiates the tasks in consistence with the precedence require...

To address the issue of unpractical and inefficient terrain page searching in terrain scheduling of flight simulations, we studied the scheduling problem for further optimization. Firstly the page format organization using the holding-boundary idea was introduced, which well disposed of the rendering sub-problem in scheduling. Then based on the organized pages, we proposed the branch-and-bound ...

With the advent of Grid and application technologies, scientists and engineers are building more and more complex decision support applications to process large data sets, and scheduling distributed decision resources. Such decision resource scheduling processes require means for composing and executing complex workflows. Therefore, many efforts have been made towards the development of workflo...

Combinatorial designs have many interesting and genuine wide applications in areas including analysis design of algorithms, cryptography, experiments, storage system design, tournament scheduling, optical communications, computer networks to mention just a few areas. In this paper, we are concerned with the transversal authentication codes as direct combinatorial designs. The novelty current pa...

A modular strategy for scheduling iterative computations is proposed. An iterative computation is represented using a cyclic task-graph. The cyclic task-graph is transformed into an acyclic task-graph. This acyclic task-graph is subsequently scheduled using one of the many well-known and high-quality static scheduling strategies from the literature. Graph unfolding is not employed and the gener...

let $g$ be a graph and let $m_{ij}(g)$, $i,jge 1$, be the number of edges $uv$ of $g$ such that ${d_v(g), d_u(g)} = {i,j}$. the {em $m$-polynomial} of $g$ is introduced with $displaystyle{m(g;x,y) = sum_{ile j} m_{ij}(g)x^iy^j}$. it is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...

Routing and scheduling act important roles in improving capacity and throughput in wireless mesh networks. In this paper, Cayley graph model is suggested for wireless Mesh Networks (WMN) with MIMO channels for efficient routing and fair scheduling. The model is based on the multiple interfaces, directional antennas, single channel mesh model. And the link edges or active edges can be viewed as ...