computational
RSS computational
Peter Cochrane's Blog: Autosync, at last
Comment There are also embedded degrees of intelligence that take care of formatting for differing screen sizes, formats, memory size, computational power, OS and application sets. Written while flying from London to Rome and dispatched on arrival at my... [22 Jul 2008]
Federated Grid Clusters Using Service Address Routed Optical Networks
White Paper Normally, clusters are composed of high performance computational nodes linked together by low-latency/high-bandwidth interconnection networks. Clusters of computers have emerged as cost-effective parallel and/or distributed computing systems for... [18 Jul 2008]
A Quality-of-Service Architecture for High-Performance Numerical Components
White Paper The paper describes quality metrics that are important for high-performance numerical simulations, including computational cost, accuracy, and rates of convergence and failure. This paper proposes a model for QoS-based composition of high... [17 Jul 2008]
Using SLA Context to Ensure Quality of Service for Composite Services
White Paper However, since nomadic consumers are typically characterized by limited computational resources, they are very dependent on reliable service providers. As service-orientation is establishing itself as the dominant design and integration paradigm... [17 Jul 2008]
A Component Framework for Building Web Science Gateways and Portals
White Paper Portlet-based Grid portals have become a crucial part of the international distributed computing infrastructure to support computational science ("Cyberinfrastructure") provide component-based problem solving environments for scientists. [11 Jul 2008]
Very Fast Optimal Bandwidth Selection for Univariate Kernel Density Estimation
White Paper The computational complexity of evaluating the density derivative at M evaluation points given N sample points from the density is O(MN). This paper proposes a computationally efficient å - exact approximation algorithm for the univariate Gaussian... [11 Jul 2008]
On Orthogonal Reduction to Hessenberg Form With Small Bandwidth
White Paper When A is Hermitian, the resulting upper Hessenberg matrix is tridiagonal, which is a significant computational advantage. Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix A to a more convenient form. [11 Jul 2008]
Towards Internet-Wide Multipath Routing
White Paper First, in a network the size of the Internet, moving to flexible multipath routing can impose significant computational and storage overhead on the routers. Today's Internet would be more efficient and robust if routers could flexibly divide... [11 Jul 2008]
An Efficient Filter for Denial-of-Service Bandwidth Attacks
White Paper A key benefit of TOPS is that it uses few computational resources and does not slow down during an attack. This paper presents an efficient method for detecting and filtering denial-of-service bandwidth attacks. [11 Jul 2008]
Fault Restoration Techniques for MPLS With QoS Constraints
White Paper In computational tests, commercial software successfully solved problem instances of this model in under six seconds on a 600 MHz DEC AlphaStation. This paper investigates distributed fault restoration protocols for MultiProtocol Label Switching... [11 Jul 2008]
ATM Dynamic Bandwidth Allocation Using F-ARIMA Prediction Model
White Paper The paper presents a simplified adaptive prediction scheme to reduce the F-ARIMA computational complexity. Measurements of high-speed network traffic have shown that traffic data exhibits a high degree of self-similarity. [11 Jul 2008]
Distributed Load Balancing in the Presence of Node Failure and Network Delays
White Paper The distribution of computational load across available resources is referred to as the load balancing problem in the literature. This algorithm is able to handle the loss of some computational nodes, the connectivity of the network, and the... [10 Jul 2008]
A Repartitioning Hypergraph Model for Dynamic Load Balancing
White Paper In parallel adaptive applications, the computational structure of the applications changes over time, leading to load imbalances even though the initial load distributions were balanced. To restore balance and to keep communication volume low in... [10 Jul 2008]
Optimistic Load Balancing in a Distributed Virtual Environment
White Paper Distributed virtual environments such as massive multi-player games require multiple servers to balance computational load. It analyzes the computational time costs of such a system and gives simulation results to gauge its performance. [10 Jul 2008]
Dynamical Discrete-Time Load Balancing in Distributed Systems in the Presence of Time Delays
White Paper The implementation of a load balancing policy on a continuous basis in a delay-limited distributed computing environment may not only drain the computational resources of each Computational Element (CE), but can also lead to an unnecessary... [10 Jul 2008]
