This document specifies a collection of compiler directives, library routines, and
environment variables that can be used to specify shared-memory parallelism in C, C++
and Fortran programs. This functionality collectively defines the specification of the
OpenMP Application Program Interface (OpenMP API). This specification provides a
model for parallel programming that is portable across shared memory architectures
from different vendors. Compilers from numerous vendors support the OpenMP API.
More information about OpenMP can be found at the following web site:
This is a simulator written in Tcl to simulate a network node carrying GSM and GPRS traffics with QoS mechanisms. The payload type including circuit-switched voice, VoIP and web traffic, and the performance including packet drop, delay can be analyzed. The implemented QoS mechanism is DiffServ, with 4 RED queues for different services with different priorities.
/*
* tesswind.c
* This program demonstrates the winding rule polygon
* tessellation property. Four tessellated objects are drawn,
* each with very different contours. When the w key is pressed,
* the objects are drawn with a different winding rule.
*/
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000.
Output:
The output is a single line for each case, with the corresponding minimum size cut.
Example:
Input:
7 11
1 2 3
1 4 3
2 3 4
3 1 3
3 4 1
3 5 2
4 6 6
4 5 2
5 2 1
5 7 1
6 7 9
Output:
5
The target of the assignment is to familiarize the student with MIMO channel modeling.
The work is based on L. Schumacher’s MIMO channel model implementation, with
added capacity analysis. First the channel model implementation is introduced, and
thereafter analysis on MIMO channel with different parameters is done. Finally a short
report on the results is written.
The many variants of the Unix operating system require use of a mode of thought that s significantly different from the one that s required by simpler operating systems. Think Unix introduces readers to important fundamental and intermediate Unix commands and, in the process, inculcates them in the Unix way of thinking. It s a worthy goal in a world with more Linux users than ever, and author Jon Lasser accomplishes it. He s both a capable writer and a knowledgeable user of Unix shell commands. Lasser uses bash under Red Hat Linux in most examples--which usually apply equally well to other Unix variants--and makes asides about other shells and environments, as needed.
This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FFT) algorithm using C++ template metaprogramming. Thank to the recursive nature of the FFT, the source code is more readable and faster than the classical implementation. The efficiency is proved by performance benchmarks on different platforms.
Aodv for NS-2. A mobile ad-hoc network (MANET) is a kind of wireless ad-hoc network, and is a self-configuring
network of mobile routers connected wirelessly. MANET may operate in a standalone fashion, or may
be connected to the larger Internet. Many routing protocols have been developed for MANETs over
the past few years. This project evaluated three specific MANET routing protocols which are Ad-hoc
On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET Ondemand
routing protocol (DYMO) to better understand the major characteristics of these routing
protocols. different performance aspects were investigated in this project including packet delivery
ratio, routing overhead, throughput and average end-to-end delay.
