NDLI: Towards a Decentralized Algorithm for Mapping Network and Computational Resources for Distributed Data-Flow Computations

Content Provider	IEEE Xplore Digital Library
Author	Asaduzzaman, S. Maheswaran, M.
Copyright Year	2007
Description	Author affiliation: Adv. Networking Res. Lab. Sch. of Comput. Sci., McGill Univ., Montreal, QC (Asaduzzaman, S.; Maheswaran, M.)
Abstract	Several high-throughput distributed data-processing applications require multi-hop processing of streams of data. These applications include continual processing on data streams originating from a network of sensors, composing a multimedia stream through embedding several component streams originating from different locations, etc. These data-flow computing applications require multiple processing nodes interconnected according to the data-flow topology of the application, for on-stream processing of the data. Since the applications usually sustain for a long period, it is important to optimally map the component computations and communications on the nodes and links in the network, fulfilling the capacity constraints and optimizing some quality metric such as end-to-end latency. The mapping problem is unfortunately NP-complete and heuristics have been previously proposed to compute the approximate solution in a centralized way. However, because of the dynamicity of the network, it is practically impossible to aggregate the correct state of the whole network in a single node. In this paper, we present a distributed algorithm for optimal mapping of the components of the data flow applications. We propose several heuristics to minimize the message complexity of the algorithm while maintaining the quality of the solution.
Starting Page	30
Ending Page	30
File Size	219965
Page Count	1
File Format	PDF
ISBN	0769528139
DOI	10.1109/HPCS.2007.32
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-05-13
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer networks Distributed computing Streaming media Bandwidth Network topology Distributed algorithms Application software Computer applications Delay Resource management
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

Towards a decentralized algorithm for mapping network and computational resources for distributed data-flow computations.

Towards a decentralized algorithm for mapping network and computational resources for distributed data-flow computations

Towards a decentralized algorithm for mapping network and computational resources for distributed data-flow computations (903).

Collecting network status information for network-aware applications

Distributed object-oriented applications supervision

Supporting Distributed Application Workflows in Heterogeneous Computing Environments

Two Tree-Based Algorithms for Network Spare Capacity Design

IPROMISE: Reliable Multi-Sender Algorithm for Peer-to-Peer Networks

Decentralized resource management for a distributed continuous media server

Towards a Decentralized Algorithm for Mapping Network and Computational Resources for Distributed Data-Flow Computations

Similar Documents

Towards a decentralized algorithm for mapping network and computational resources for distributed data-flow computations.

Towards a decentralized algorithm for mapping network and computational resources for distributed data-flow computations

Towards a decentralized algorithm for mapping network and computational resources for distributed data-flow computations (903).

Collecting network status information for network-aware applications

Distributed object-oriented applications supervision

Supporting Distributed Application Workflows in Heterogeneous Computing Environments

Two Tree-Based Algorithms for Network Spare Capacity Design

IPROMISE: Reliable Multi-Sender Algorithm for Peer-to-Peer Networks

Decentralized resource management for a distributed continuous media server

Towards a Decentralized Algorithm for Mapping Network and Computational Resources for Distributed Data-Flow Computations