NDLI: What Can be Computed Locally?

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Naor, Moni Stockmeyer, Larry
Copyright Year	1995
Abstract	The purpose of this paper is a study of computation that can be done locally in a distributed network, where locally means within time (or distance) independent of the size of the network. Locally checkable labeling (LCL) problems are considered, where the legality of a labeling can be checked locally (e.g., coloring). The results include the following: There are nontrivial LCL problems that have local algorithms. There is a variant of the dining philosophers problem that can be solved locally. Randomization cannot make an LCL problem local; i.e., if a problem has a local randomized algorithm then it has a local deterministic algorithm. It is undecidable, in general, whether a given LCL has a local algorithm. However, it is decidable whether a given LCL has an algorithm that operates in a given time t. Any LCL problem that has a local algorithm has one that is order-invariant (the algorithm depends only on the order of the processor IDs).
Starting Page	1259
Ending Page	1277
Page Count	19
File Format	PDF
ISSN	00975397
DOI	10.1137/S0097539793254571
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	6
Volume Number	24
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2006-07-13
Access Restriction	Subscribed
Subject Keyword	local computation resource allocation randomized algorithms distributed computation graph labeling problem Graph theory Network design and communication Combinatorics dining philosophers problem
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

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

What Can Be Computed Locally? (1993)

What Can Be Computed Locally? (1993)

Local Labeling and Resource Allocation Using Preprocessing

A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring

What Can be Sampled Locally?

The Token Distribution Problem

Efficient fault-tolerant algorithms for distributed resource allocation

Planarity can be Verified by an Approximate Proof Labeling Scheme in Constant-Time

Efficient Upload Bandwidth Estimation and Communication Resource Allocation Techniques

What Can be Computed Locally?

Similar Documents

What Can Be Computed Locally? (1993)

What Can Be Computed Locally? (1993)

Local Labeling and Resource Allocation Using Preprocessing

A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring

What Can be Sampled Locally?

The Token Distribution Problem

Efficient fault-tolerant algorithms for distributed resource allocation

Planarity can be Verified by an Approximate Proof Labeling Scheme in Constant-Time

Efficient Upload Bandwidth Estimation and Communication Resource Allocation Techniques

What Can be Computed Locally?