NDLI: Low-contention depth-first scheduling of parallel computations with write-once synchronization variables

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

Compact routing schemes

Routing without flow control

Fast, minimal and oblivious routing algorithms on the mesh with bounded queues

One-to-Many routing on the mesh

Simple on-line algorithms for the maximum disjoint paths problem

Stability and non-stability of the FIFO protocol

Competitve buffer management for shared-memory switches

Tradeoffs between knowledge and time of communication in geometric radio networks

Attack propagation in networks

Deterministic resource discovery in distributed networks

Latency effects on reachability in large-scale peer-to-peer networks

Towards a first vertical prototyping of an extremely fine-grained parallel programming approach

A cost effective architecture for vectorizable numerical and multimedia applications

Automatable verification of sequential consistency

Room synchronizations

A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems

Computational power of pipelined memory hierarchies

Optimal semi-oblique tiling

Finding large independent sets of hypergraphs in parallel

Columnsort lives! an efficient out-of-core sorting program

Efficient parallel exponentiation in GF(2n) using normal basis representations

Low-contention depth-first scheduling of parallel computations with write-once synchronization variables

Scheduling on hierarchical clusters using malleable tasks

Scheduling best-effort and real-time pipelined applications on time-shared clusters

Optimal prefetching and caching for parallel I/O sytems

Ordering disks for double erasure codes

Approximation algorithms for data management in networks

A data tracking scheme for general networks

New spectral bounds on k-partitioning of graphs

Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

Towards practical deteministic write-all algorithms

Estimating simple functions on the union of data streams

Randomized k-set agreement

Periodic, random-fault-tolerant correction networks

D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks

A note on cycle covering

Pursuit and evasion on a ring: An infinite hierarchy for parallel real—time systems

Scheduling tasks with small communication delays for clusters of processors

Library support for orthogonal processor groups

The push tree problem

Parallel controlled conspiracy number search

On tiling space-time mapped loop nests

A parallel block algorithm for exact triangularization of rectangular matrices

Eventually consistent failure detectors

Finding strongly connected components in parallel in particle transport sweeps

A work-optimal CGM algorithm for the LIS problem

Modeling weakly consistent memories with locks

The power of duality for prefetching and sorting with parallel disks

Low-contention depth-first scheduling of parallel computations with write-once synchronization variables

Content Provider	ACM Digital Library
Author	Fatourou, Panagiota
Abstract	We present an efficient, randomized, online, scheduling algorithm for a large class of programs with write-once synchronization variables. The algorithm combines the work-stealing paradigm with the depth-first scheduling technique, resulting in high space efficiency and good time complexity. By automatically increasing the granularity of the work scheduled on each processor, our algorithm achieves good locality, low contention and low scheduling overhead, improving upon a previous depth-first scheduling algorithm [6] published in SPAA '97. Moreover, it is probably efficient for the general class of multithreaded computations with write-once synchronization variables (as studied in [6]), improving upon algorithm DFDeques (published in SPAA'99 [24]), which is only for the more restricted class of nested parallel computations.More specifically, consider such a computation with work T 1, depth T ∞ and &sgr; synchronizations, and suppose that space S 1 suffices to execute the computation on a single-processor computer. Then, on a P-processor shared-memory parallel machine, the expected space complexity of our algorithm is at most S 1 + &Ogr;(PT∞ log (PT∞)), and its expected time complexity is &Ogr;(T 1/P + &sgr; log (PT∞)/P + T∞ log (PT∞)). Moreover, for any ∈ > 0, the space complexity of our algorithm is S 1 + &Ogr;(P(T∞ + ln(1/∈)) log(P(T∞ + ln(P(T∞(1/∈))/∈)))) with probability at least 1 — ∈. Thus, even for values of ∈ as small ∈ —T∞, the space complexity of our algorithm is at most S 1 + &Ogr;(PT∞ log(PT∞)) with probability at least 1 — ∈ —T∞. These bounds include all time and space costs for both the computation and the scheduler.
Starting Page	189
Ending Page	198
Page Count	10
File Format	PDF
ISBN	1581134096
DOI	10.1145/378580.378639
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2001-07-03
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

Low-Contention Depth-First Scheduling of Parallel Computations with Write-Once Synchronization Variables (2001)

Towards practical deteministic write-all algorithms

Parallel Computations in Graph Theory

Scheduling computations with provably low synchronization overheads

Optimal distribution and scheduling of parallel workloads with synchronization delays

Dynamic scheduling of parallel computations (1996).

Space-efficient scheduling of parallelism with synchronization variables

The Cost of Concurrent, Low-Contention Read&Modify&Write (2003)

The Cost of Concurrent, Low-Contention Read-Modify-Write (2005)

Low-contention depth-first scheduling of parallel computations with write-once synchronization variables

Similar Documents

Low-Contention Depth-First Scheduling of Parallel Computations with Write-Once Synchronization Variables (2001)

Towards practical deteministic write-all algorithms

Parallel Computations in Graph Theory

Scheduling computations with provably low synchronization overheads

Optimal distribution and scheduling of parallel workloads with synchronization delays

Dynamic scheduling of parallel computations (1996).

Space-efficient scheduling of parallelism with synchronization variables

The Cost of Concurrent, Low-Contention Read&Modify&Write (2003)

The Cost of Concurrent, Low-Contention Read-Modify-Write (2005)

Low-contention depth-first scheduling of parallel computations with write-once synchronization variables