Advent of multi-core designs has paved way towards breaking the Exa-scale performance barrier and hence it is been a major focus for modern computer architecture research. It is evident that future generation super computers would have hundreds of multi-core processors at the node level and proportionately a higher number at the cluster level too. Simulation has become a primary technique for e...

This paper derives upper bounds on the expected number of search tree nodes visited during an m-solution backtracking search, a search which terminates after some pre-selected number m problem solutions are found. The search behavior is assumed to have a general probabilistic structure. Our results are stated in terms of node expansion and contraction. A visited search tree node is said to be e...

In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of interconnection networks based on IP graphs to achieve desired properties; the results compare favorably with popular interconnection networks, as measured by topological (e.g., node degree and diameter) and algorithmic pro...

2 [email protected] 3 [email protected] AbstractIt develops an stability model for finding the optimal distribution strategy to maximize performance of key predistribution protocols in terms of cost, resilience, connectivity, and lifetime Using super networks theory, the optimal node deployment model is proposed. In order to find the equilibrium performance of our model, all optimal perf...

SMP cluster (CLUMPs) architecture has been widely used to provide scalable high performance computers recently. One distinctive feature over traditional parallel computer architecture is its hybrid memory model, shared memory inside the node and message passing between the nodes. In this paper, we study the hybrid programming model of MPI+OpenMP on CLUMPs architecture. We analyze the implementa...

We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connection cost to the chosen node, and shares fairly facility installation cost with other agents having chosen the same location. This game has pure strategy Nash equilibria, that can be found by simple improvements performed by the...

In Wireless sensor networks, several routing protocols have been developed to improve the various parameters such as stability period, throughput etc . After a homogenous protocol leach, many heterogeneous protocol were developed which successfully improved the routing in WSNs . In this Paper we studied one of the heterogeneous protocol DEEC and its improved version EDEEC and we tried to work o...

We introduce a decentralized replication strategy for peerto-peer file exchange based on exhaustive exploration of the neighborhood of any node in the network. The replication scheme lets the replicas evenly populate the network mesh, while regulating the total number of replicas at the same time. This is achieved by self adaptation to entering or leaving of nodes. Exhaustive exploration is ach...

Absorbance-Modulation-Optical Lithography (AMOL) enables super-resolution optical lithography by simultaneous illumination of a photochromic film by a bright spot at one wavelength, λ1 and a node at another wavelength, λ2. A deep subwavelength region of the transparent photochromic isomer is created in the vicinity of the node. Light at λ1 penetrates this region and exposes an underlying photor...

We consider networks where energy is a limited resource so that energy consumption must be minimized while satisfying given throughput requirements. For such networks, cross-layer design coupled with node cooperation can significantly reduce both energy consumption and delay. In this paper, we propose a cooperative multiple-input multiple-output (MIMO) technique where multiple nodes within a cl...