node compute
RSS node computeSort by: Relevance | Date
A Scalable Logical Coordinates Framework for Routing in Wireless Sensor Networks
White Paper The location information needed for this scheme, however, is not easy to compute accurately using current localization algorithms. Geographic routing is the most scalable routing scheme for statically placed nodes in that it uses only a constant... [23 Aug 2007]
Self-Configurable Key Pre-Distribution in Mobile Ad Hoc Networks
White Paper This paper presents two new schemes that, in the absence of a centralized support, allow a pair of nodes of a mobile ad hoc network to compute a shared key without communicating. The paper evaluates and compares the performance of both the schemes... [01 Aug 2007]
Towards Achieving the Maximum Capacity in Large Mobile Wireless Networks Under Delay Constraints
White Paper Based on these inherent tradeoffs, it is able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. This paper explains how to achieve the maximum capacity under delay... [20 Jul 2007]
A Throughput-Intensive Compute and Storage Grid Using SAS Grid Manager
White Paper This paper will discuss the considerations made in selecting the key grid components: grid node hardware, network infrastructure, and storage strategy. The time has come when a $2,000,000 SMP UNIX server can be replaced by a $200,000 grid of even... [02 Jun 2007]
Subchannel Assignment in OFDM Relay Nodes
White Paper In particular, the authors consider a channel-aware relay node and compute the subchannel reassignment that optimizes a selected performance criterion. The paper considers a source-relay-destination link in which the relay node is allowed to... [11 Apr 2007]
Windows Compute Cluster Server 2003 Beta 2
White Paper For customers solving complex computational problems, Windows Compute Cluster Server 2003 Beta 2 will accelerate time-to-insight by providing a High-Performance Computing (HPC) platform that is simple to deploy, operate, and integrate with... [26 Dec 2006]
Balancing the Accuracy and Practicality of Location Tracking in Heterogeneous Mobile Networks
White Paper It is often difficult to precisely compute the location of a node because of the infrastructure costs and the errors inherent in most tracking techniques. The authors consider a generalized notion of location called vicinity which is the set of... [09 Dec 2006]
University of Nottingham and Sun Microsystems Streamline Computing and Allinea Software; Unveil Second Largest Academic Computer System in Europe
White Paper The University of Nottingham selected Sun Microsystems and Streamline Computing to build a multi-million pound 500+ node central compute grid which will provide the University with three teraflops of peak computational performance. [27 Sep 2006]
A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks
White Paper The approach is based on a well-known approximation algorithm to compute minimum degree spanning trees. The idea is to use multiple directional antennas on each node and orient them appropriately to create low interference topologies while... [30 Jun 2006]
Understanding the Scalability of NWChem in HPC Environments
White Paper NWChem, compute-intensive computational chemistry package, is one such application that can benefit from the performance and computational power provided by high-performance computing (HPC) clusters. This paper introduces NWChem and explains the... [07 May 2005]
Windows for clusters due in autumn
News Software architect Marvin Theimer said on Thursday that the company hopes to have a beta version by this summer, with the final version of Windows Server 2003 Compute Cluster Edition ready by the SC2005 supercomputing conference in November. [04 Mar 2005]
PNNL's HP Supercomputer Is Fastest Open System in U.S.
White Paper The challenge was that Pacific Northwest National Laboratories (PNNL) required a system that had the ability to quickly compute complex, long-running simulations and an efficient software that was scaleable across the entire system. [13 Jan 2005]
XML Path Language (XPath)
White Paper XPath defines a way to compute a string-value for each type of node. Thus, the name of a node is modeled as a pair consisting of a local part and a possibly null namespace URI; this is called an expanded-name. [25 Feb 2004]
Scalable Web Server Cluster Design with Workload-Aware Request Distribution Strategy WARD
White Paper We propose an algorithm, called ward-analysis, to compute the nearly optimal core size. In this work, we consider a web cluster in which the content-aware distribution is performed by each of the node in a web cluster. [25 Feb 2004]
Efficient Communications Subsystems for a Cost-Effective, High-Performance Beowulf Cluster
White Paper After selecting the appropriate compute node, the next design step is to decide the communications subsystem. This is the "gluing technology" that turns a group of autonomous compute nodes into a high-performance Beowulf cluster. [25 Feb 2004]
