"DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors" - Information and Links:

DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors - Info and Reading Options

"DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors" and the language of the book is English.


“DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors” Metadata:

  • Title: ➤  DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors
  • Author: ➤  
  • Language: English

Edition Identifiers:

  • Internet Archive ID: DTIC_ADA286047

AI-generated Review of “DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors”:


"DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors" Description:

The Internet Archive:

This thesis investigates the problem of statically assigning the tasks of applications represented by repetitive task graphs (such as sonar or radar signal processing) to the processors of a distributed memory multiprocessor system with the objective of maximizing graph instance throughput. The repetitive nature of these task graphs allows for pipelining and the overlapping of successive graph instances, suggesting a departure from classical directed acyclic graph scheduling techniques. To investigate such a claim, a version of the Mapping Heuristic (MH) ELR 90 is extended for use with iterative applications. Then a new heuristic, Periodic Scheduling (PS), is developed to capitalize on the repetitive nature of these task graphs by overlapping successive graph instances. The PS heuristic assigns tasks to processors in such a way so as to minimize the maximal utilization of the processors and the communications links between them. This maximal utilization figure dictates the interval between successive instances of the task graph. We conduct experiments in which the graph instance throughput of PS is compared to that of MH across a broad range of processor topologies, utilizing several communications/computation ratios. It is shown that, compared to MH, the PS heuristic improves the throughput performance between two and 50 percent. Particularly noteworthy improvement is noted on systems with high average inter-node communications costs. Assignment, Distributed processors, Heuristic algorithm, Mapping problem, Scheduling.

Read “DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors”:

Read “DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors” by choosing from the options below.

Available Downloads for “DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors”:

"DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors" is available for download from The Internet Archive in "texts" format, the size of the file-s is: 27.98 Mbs, and the file-s went public at Tue Mar 20 2018.

Legal and Safety Notes

Copyright Disclaimer and Liability Limitation:

A. Automated Content Display
The creation of this page is fully automated. All data, including text, images, and links, is displayed exactly as received from its original source, without any modification, alteration, or verification. We do not claim ownership of, nor assume any responsibility for, the accuracy or legality of this content.

B. Liability Disclaimer for External Content
The files provided below are solely the responsibility of their respective originators. We disclaim any and all liability, whether direct or indirect, for the content, accuracy, legality, or any other aspect of these files. By using this website, you acknowledge that we have no control over, nor endorse, the content hosted by external sources.

C. Inquiries and Disputes
For any inquiries, concerns, or issues related to the content displayed, including potential copyright claims, please contact the original source or provider of the files directly. We are not responsible for resolving any content-related disputes or claims of intellectual property infringement.

D. No Copyright Ownership
We do not claim ownership of any intellectual property contained in the files or data displayed on this website. All copyrights, trademarks, and other intellectual property rights remain the sole property of their respective owners. If you believe that content displayed on this website infringes upon your intellectual property rights, please contact the original content provider directly.

E. Fair Use Notice
Some content displayed on this website may fall under the "fair use" provisions of copyright law for purposes such as commentary, criticism, news reporting, research, or educational purposes. If you believe any content violates fair use guidelines, please reach out directly to the original source of the content for resolution.

Virus Scanning for Your Peace of Mind:

The files provided below have already been scanned for viruses by their original source. However, if you’d like to double-check before downloading, you can easily scan them yourself using the following steps:

How to scan a direct download link for viruses:

  • 1- Copy the direct link to the file you want to download (don’t open it yet).
    • (a free online tool) and paste the direct link into the provided field to start the scan.
  • 2- Visit VirusTotal (a free online tool) and paste the direct link into the provided field to start the scan.
  • 3- VirusTotal will scan the file using multiple antivirus vendors to detect any potential threats.
  • 4- Once the scan confirms the file is safe, you can proceed to download it with confidence and enjoy your content.

Available Downloads

  • Source: Internet Archive
  • Internet Archive Link: Archive.org page
  • All Files are Available: Yes
  • Number of Files: 16
  • Number of Available Files: 16
  • Added Date: 2018-03-20 16:26:03
  • PPI (Pixels Per Inch): 300

Available Files:

1- Text PDF

  • File origin: original
  • File Format: Text PDF
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047.pdf
  • Direct Link: Click here

2- Metadata

  • File origin: original
  • File Format: Metadata
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_files.xml
  • Direct Link: Click here

3- Metadata

  • File origin: original
  • File Format: Metadata
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_meta.sqlite
  • Direct Link: Click here

4- Metadata

  • File origin: original
  • File Format: Metadata
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_meta.xml
  • Direct Link: Click here

5- Item Tile

  • File origin: original
  • File Format: Item Tile
  • File Size: 0.00 Mbs
  • File Name: __ia_thumb.jpg
  • Direct Link: Click here

6- Abbyy GZ

  • File origin: derivative
  • File Format: Abbyy GZ
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_abbyy.gz
  • Direct Link: Click here

7- chOCR

  • File origin: derivative
  • File Format: chOCR
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_chocr.html.gz
  • Direct Link: Click here

8- DjVuTXT

  • File origin: derivative
  • File Format: DjVuTXT
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_djvu.txt
  • Direct Link: Click here

9- Djvu XML

  • File origin: derivative
  • File Format: Djvu XML
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_djvu.xml
  • Direct Link: Click here

10- hOCR

  • File origin: derivative
  • File Format: hOCR
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_hocr.html
  • Direct Link: Click here

11- OCR Page Index

  • File origin: derivative
  • File Format: OCR Page Index
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_hocr_pageindex.json.gz
  • Direct Link: Click here

12- OCR Search Text

  • File origin: derivative
  • File Format: OCR Search Text
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_hocr_searchtext.txt.gz
  • Direct Link: Click here

13- Single Page Processed JP2 ZIP

  • File origin: derivative
  • File Format: Single Page Processed JP2 ZIP
  • File Size: 0.02 Mbs
  • File Name: DTIC_ADA286047_jp2.zip
  • Direct Link: Click here

14- Page Numbers JSON

  • File origin: derivative
  • File Format: Page Numbers JSON
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_page_numbers.json
  • Direct Link: Click here

15- Scandata

  • File origin: derivative
  • File Format: Scandata
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_scandata.xml
  • Direct Link: Click here

16- Archive BitTorrent

  • File origin: metadata
  • File Format: Archive BitTorrent
  • File Size: 0.00 Mbs
  • File Name: DTIC_ADA286047_archive.torrent
  • Direct Link: Click here

Search for “DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors” in Libraries Near You:

Read or borrow “DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors” from your local library.

Buy “DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors” online:

Shop for “DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors” on popular online marketplaces.



Find "DTIC ADA286047: A Periodic Scheduling Heuristic For Mapping Iterative Task Graphs Onto Distributed Memory Multiprocessors" in Wikipdedia