Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleApril 2005
A Powerful Direct Mechanism for Optimal WWW Content Replication
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 86https://doi.org/10.1109/IPDPS.2005.58This paper addresses the problem of fine-grained data replication in large distributed systems, such as the Internet, so as to minimize the user access delays. With fine-grained data replication, certain data objects, as opposed to a complete site, are ...
- ArticleApril 2005
A Neural Network Based Predictive Mechanism for Available Bandwidth
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 33.1https://doi.org/10.1109/IPDPS.2005.51Most recent developments of computer sciences, such as web services, Grid, peer-to-peer, and mobile computing, are network-based computing. Their applicability depends on the availability of the underlying network bandwidth. However, network resources ...
- ArticleApril 2005
- ArticleApril 2005
A Memory-Effective Routing Strategy for Regular Interconnection Networks
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 41.2https://doi.org/10.1109/IPDPS.2005.44Massively parallel computing systems have been or are being built with thousands of nodes. In such systems, high-performance interconnection networks are crucial to achieve the maximum performance. Routing is one of the most important design issues of ...
-
- ArticleApril 2005
To Unify Structured and Unstructured P2P Systems
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 104.1https://doi.org/10.1109/IPDPS.2005.436Most of current peer-to-peer designs build their own system overlays independent of the physical one. Nodes within unstructured systems form a random overlay, on the contrary, structured designs normally organize peers into an elegant identifier ring. ...
- ArticleApril 2005
Self-Managing Sensor-Based Middleware for Performance Monitoring and Data Integration in Grids
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 13.2https://doi.org/10.1109/IPDPS.2005.399This paper describes a sensor-based middleware for performance monitoring and data integration in the Grid that is capable of self-management. The middleware unifies both system and application monitoring in a single system, storing various types of ...
- ArticleApril 2005
Rapidly Mixing Random Walks on Hypercubes with Application to Dynamic Tree Evolution
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 60.2https://doi.org/10.1109/IPDPS.2005.372In many tree-structured parallel computations, the size and shape of a tree that represents a parallel computation is unpredictable at compile-time. The tree evolves gradually during the course of the computation. When such an application is executed on ...
- ArticleApril 2005
QoS Aware Job Scheduling in a Cluster-Based Web Server for Multimedia Applications
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 93.1https://doi.org/10.1109/IPDPS.2005.368We propose a cluster-based web server where a few computing nodes are separately reserved for high-performance computing applications, such as multimedia, SSL, and CGI. As an example application, we consider a multimedia server that dynamically ...
- ArticleApril 2005
PROC: Process ReOrdering-Based Coscheduling on Workstation Clusters
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 50https://doi.org/10.1109/IPDPS.2005.361Workstation clusters are emerging as a platform for the execution of general-purpose workloads. To use clusters as shared computing servers, scheduling techniques able to effectively handle workloads with diverse characteristics on demands, are required. ...
- ArticleApril 2005
Practical Divisible Load Scheduling on Grid Platforms with APST-DV
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 29.2https://doi.org/10.1109/IPDPS.2005.351Divisible load applications consist of a load, that is input data and associated computation, that can be divided arbitrarily into independent pieces. Such applications arise in many fields and are ideally suited to a master-worker execution, but they ...
- ArticleApril 2005
Power Saving in Regular Interconnection Networks Built with High-Degree Switches
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 5.2https://doi.org/10.1109/IPDPS.2005.349Nowadays, high-degree switches are available as building blocks of the interconnection network of clusters of PCs. An alternative to take advantage of the high number of switch ports is to connect every pair of switches through not only one but several ...
- ArticleApril 2005
Power and Energy Profiling of Scientific Applications on Distributed Systems
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 34https://doi.org/10.1109/IPDPS.2005.346Power consumption is a troublesome design constraint for emergent systems such as IBM's BlueGene /L. If current trends continue, future petaflop systems will require 100 megawatts of power to maintain high-performance. To address this problem the power ...
- ArticleApril 2005
Peta-Scale Computing
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 38https://doi.org/10.1109/IPDPS.2005.342In a few short years, computers capable of over one Petaflops performance will become a reality. The most likely approach for first successfully reaching this performancelevel will involve several thousands of parallel processing elements. What are the ...
- ArticleApril 2005
Performance Implications of Virtualization and Hyper-Threading on High Energy Physics Applications in a Grid Environment
- Laura Gilbert,
- Jeff Tseng,
- Rhys Newman,
- Saeed Iqbal,
- Ronald Pepper,
- Onur Celebioglu,
- Jenwei Hsieh,
- Mark Cobban
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 32.1https://doi.org/10.1109/IPDPS.2005.338The simulations used in the field of high energy physics are compute intensive and exhibit a high level of data parallelism. These features make such simulations ideal candidates for Grid computing. We are taking as an example the GEANT4 detector ...
- ArticleApril 2005
On the Optimal Placement of Secure Data Objects over Internet
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 14https://doi.org/10.1109/IPDPS.2005.306Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changing the number of shares in secret sharing schemes can be costly. To ...
- ArticleApril 2005
On Scheduling Complex Dags for Internet-Based Computing
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 66https://doi.org/10.1109/IPDPS.2005.304Conceptual tools are developed to aid in crafting a theory of scheduling complex computation-dags for Internetbased computing. The goal of the schedules produced is to render tasks eligible for allocation to remote clients (hence for execution) at the ...
- ArticleApril 2005
Modeling and Taming Parallel TCP on the Wide Area Network
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 68.2https://doi.org/10.1109/IPDPS.2005.291Parallel TCP flows are broadly used in the high performance distributed computing community to enhance network throughput, particularly for large data transfers. Previous research has studied the mechanism by which parallel TCP improves aggregate ...
- ArticleApril 2005
MaTCH: Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 64.2https://doi.org/10.1109/IPDPS.2005.274We develop in this paper a new heuristic for mapping a set of heterogeneous interacting tasks of a parallel application onto a heterogeneous computing platform. The problem is well known in literature to be an NP-Hard problem. However, we propose a ...
- ArticleApril 2005
A Framework to Support Survivable Web Services
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01April 2005, Page 93.2https://doi.org/10.1109/IPDPS.2005.27Web services have gained high popularity in the development of distributed application systems. Some critical applications also consider using web services paradigm due to the benefits of interoperability, reusability, and adaptability. To support ...
