Sciweavers

59 search results - page 5 / 12
» Implementing Replica Placements: Feasibility and Cost Minimi...
Sort
View
HEURISTICS
2000
127views more  HEURISTICS 2000»
13 years 7 months ago
Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
Joel W. Gannett
PPOPP
2010
ACM
14 years 5 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
ICDCS
2006
IEEE
14 years 2 months ago
PRINS: Optimizing Performance of Reliable Internet Storages
Distributed storage systems employ replicas or erasure code to ensure high reliability and availability of data. Such replicas create great amount of network traffic that negative...
Qing Yang, Weijun Xiao, Jin Ren
EDBT
2000
ACM
13 years 11 months ago
Performance and Availability Assessment for the Configuration of Distributed Workflow Management Systems
Workflow management systems (WFMSs) that are geared for the orchestration of enterprise-wide or even "virtual-enterprise"-style business processes across multiple organi...
Michael Gillmann, Jeanine Weißenfels, Gerhar...
ISPDC
2006
IEEE
14 years 1 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun