NDLI: Data management in hierarchical bus networks

Please wait, while we are loading the content...

The data locality of work stealing

Scheduling Cilk multithreaded parallel programs on processors of different speeds

Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract)

Diffusive load balancing schemes on heterogeneous networks

Interprocessor communication with memory constraints

Efficient on-line communication in cellular networks

Connection caching under various models of communication

Fault tolerant networks with small degree

Generalized connection caching

Comparing the effectiveness of fine-grain memory caching against page migration/replication in reducing traffic in DSM clusters

Asynchronous scheduling of redundant disk arrays

Infinite parallel job allocation (extended abstract)

Data management in hierarchical bus networks

Efficient, distributed data placement strategies for storage area networks (extended abstract)

Broadcast scheduling optimization for heterogeneous cluster systems

DCAS-based concurrent deques

A no-busy-wait balanced tree parallel algorithmic paradigm

Algorithmic foundations for a parallel vector access memory system

An experimental study of a simple, distributed edge coloring algorithm

Multithreaded algorithms for the fast Fourier transform

A (2.954 + ε)n oblivious routing algorithm on 2D meshes

VLSI layout and packaging of butterfly networks

Compact, multilayer layout for butterfly fat-tree

An efficient self-simulation algorithm for reconfigurable meshes

Data management in hierarchical bus networks

Content Provider	ACM Digital Library
Author	Meyer auf der Heide, F. Räcke, H. Westermann, M.
Abstract	A hierarchical bus network T = (V, E) uses hierarchically, tree-like connected buses as a communication network. New communication technologies like SCI (Scalable Coherent Interface) (see, e.g., [6, 7]) make such networks very attractive, because they allow their easy construction and guarantee reasonable communication performance. Such networks can be modeled as tree networks: leaves correspond to processors, inner nodes to buses, edges to switches, and bandwidths of inner nodes and edges are related to bandwidths of buses and switches, respectively.In this paper we address the problem of static data management. Given a set of shared data objects X and the read and write frequencies from the processors to the shared data objects, the goal is to compute a (maybe redundant) placement of the shared data objects to the processors, such that the congestion (the maximum over the load of all edges and inner nodes, induced by the read and write frequencies, divided by the bandwidth of the edge or inner node, respectively) is minimized. It is known [10] that this problem can be solved optimally in linear time, if inner nodes are allowed to hold copies of shared data objects. In our model, inner nodes correspond to buses and therefore cannot store copies of shared data objects. We show that this restriction increases the complexity of the placement problem drastically: It becomes NP-hard. On the other hand, the main contribution of our paper is an approximation algorithm with runtime O(\|X\|·\|V\|·height(T) · log (degree(T)) that increases the congestion by a factor of at most 7.
Starting Page	109
Ending Page	118
Page Count	10
File Format	PDF
ISBN	1581131852
DOI	10.1145/341800.341814
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2000-07-09
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Data management in hierarchical bus networks (2000)

Data Management in Hierarchical Bus Networks (2000)

Data management in hierarchical bus networks (2000)

Hierarchical value cache encoding for off-chip data bus

Hierarchical Data Management for Spatial-Temporal Information in WSNs

A Hierarchical data replication method in ad hoc networks

Hierarchical data aggregation model and group management for wireless sensor networks

Communication performance in a hierarchical bus system.

Abstract benchmarking mesh and hierarchical bus networks in system-on-chip context.

Data management in hierarchical bus networks

Similar Documents

Data management in hierarchical bus networks (2000)

Data Management in Hierarchical Bus Networks (2000)

Data management in hierarchical bus networks (2000)

Hierarchical value cache encoding for off-chip data bus

Hierarchical Data Management for Spatial-Temporal Information in WSNs

A Hierarchical data replication method in ad hoc networks

Hierarchical data aggregation model and group management for wireless sensor networks

Communication performance in a hierarchical bus system.

Abstract benchmarking mesh and hierarchical bus networks in system-on-chip context.

Data management in hierarchical bus networks