Practical resource management for grid-based visual exploration

Czajkowski, Karl; Demir, Alper Kamil; Kesselman, Carl; Thiebaux, Marcus

doi:10.1109/hpdc.2001.945209

Cited by 10 publications

(6 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The management of hierarchical infrastructure can, however, become quite cumbersome. The Jini system6 by Sun allows for a universal plug and play for various devices. The Jini system, however, does not scale well.…”

Section: Discovery and Search In Distributed Grid Systemsmentioning

confidence: 99%

“…Globus . Globus5–7,46,48 provides a software infrastructure that enables applications to view distributed heterogeneous computing resources as a single virtual machine. The Globus project is an American multi‐institutional research effort that seeks to enable the construction of computational grids.…”

Section: Discovery and Search In Distributed Grid Systemsmentioning

confidence: 99%

“…The grids are inherently designed as hierarchical, whereas the P2P environment is characterized as unstructured. Work done in Ref 6 proposed the concept of super peer networks, which is more suited to P2P grids. Such an environment maximizes the efficiency of centralized search typical of grids and at the same time encourages the autonomy feature specific to P2P environment.…”

Section: Peer‐to‐peer (P2p) Environmentsmentioning

confidence: 99%

See 2 more Smart Citations

Distributed grid‐type architectures

Alnoshan

Rotenstreich

2010

WIREs Computational Stats

View full text Add to dashboard Cite

Research advances in the distributed computing have led to grid computing, which unlike many other areas of distributed computing focuses on large-scale resource sharing and discovery for better performance. Traditionally, grid computing has been performed in a client/server format. However, recent advances in the area of peer-to-peer computing have brought a paradigm shift in the field of distributed systems and have forced researchers in the area of grid computing to discuss peer-to-peer grids. In this article, we will review the work done in the area of grid computing and discuss peer-to-peer grids with a focus on a framework that provides incentive to the participating resources in a peer-to-peer grid environment. The framework provides the basis for defining a utility function that is used by participating nodes to efficiently allocate the resources that are available in a system. We finish by mentioning the evolving area of cloud computing.

show abstract

Section: Discovery and Search In Distributed Grid Systemsmentioning

confidence: 99%

Section: Discovery and Search In Distributed Grid Systemsmentioning

confidence: 99%

Section: Peer‐to‐peer (P2p) Environmentsmentioning

confidence: 99%

See 1 more Smart Citation

Distributed grid‐type architectures

Alnoshan

Rotenstreich

2010

WIREs Computational Stats

View full text Add to dashboard Cite

show abstract

“…Tools, such as the CVM service [16] and the Grid Visualization Utility [8], allow scientists Ideally, scientists should be able to interactively analyze large datasets from their desktop computers whether the datasets are stored at a local or at a remote location. Supporting interactive access to these datasets is challenging because, as dataset sizes grow, query latency increases due to the large amount of data movement between various levels of the memory hierarchy [31].…”

Section: Introductionmentioning

confidence: 99%

“…Researchers at the University of Southern California's Information Science Institute (USC/ISI) are developing tools to visualize output wavefield datasets as part of the grid visualization utility project (GVU) [8]. A pre-processing step samples the dataset at the finest available granularity and aggregates multiple fine-grained points to create a coarser version of the dataset.…”

Section: Visualization Of 4d Wavefieldsmentioning

confidence: 99%

Big Wins with Small Application-Aware Caches

López

O’Hallaron

Proceedings of the ACM/IEEE SC2004 Conference

View full text Add to dashboard Cite

Large datasets, on the order of GB and TB, are increasingly common as abundant computational resources allow practitioners to collect, produce and store data at higher rates. As dataset sizes grow, it becomes more challenging to interactively manipulate and analyze these datasets due to the large amounts of data that need to be moved and processed. Application-independent caches, such as operating system page caches and database buffer caches, are present throughout the memory hierarchy to reduce data access times and alleviate transfer overheads. We claim that an applicationaware cache with relatively modest memory requirements can effectively exploit dataset structure and application information to speed access to large datasets. We demonstrate this idea in the context of a system named the tree cache, to reduce query latency to large octree datasets by an order of magnitude.

show abstract