From 887f487935df66610ddc3c62bfddcc2ed34b7d86 Mon Sep 17 00:00:00 2001 From: Isaac Shoebottom Date: Tue, 14 Jan 2025 09:25:30 -0400 Subject: [PATCH] 2025-01-14 09:25:30 --- .obsidian/plugins/various-complements/histories.json | 2 +- UNB/Year 5/Semester 2/CS4745/Lecture Notes.md | 9 ++++++++- 2 files changed, 9 insertions(+), 2 deletions(-) diff --git a/.obsidian/plugins/various-complements/histories.json b/.obsidian/plugins/various-complements/histories.json index 9e0b8ef..3fad9e2 100644 --- a/.obsidian/plugins/various-complements/histories.json +++ b/.obsidian/plugins/various-complements/histories.json @@ -1 +1 @@ -{"algorithm":{"algorithm":{"currentFile":{"count":1,"lastUpdated":1736360369637}}},"computing":{"computing":{"currentFile":{"count":2,"lastUpdated":1736427522780}}},"tasks":{"tasks":{"currentFile":{"count":1,"lastUpdated":1736428160890}}},"parallelization":{"parallelization":{"currentFile":{"count":1,"lastUpdated":1736428239757}}},"Implicit":{"Implicit":{"currentFile":{"count":1,"lastUpdated":1736429811730}}},"Semi-implicit":{"Semi-implicit":{"currentFile":{"count":1,"lastUpdated":1736429857427}}},"Agent":{"Agent":{"currentFile":{"count":1,"lastUpdated":1736527234430}}},"Agents":{"Agents":{"currentFile":{"count":3,"lastUpdated":1736528265726}}},"actions":{"actions":{"currentFile":{"count":1,"lastUpdated":1736527553391}}},"successful":{"successful":{"currentFile":{"count":1,"lastUpdated":1736527687166}}},"agents":{"agents":{"currentFile":{"count":3,"lastUpdated":1736529446424}}},"environment":{"environment":{"currentFile":{"count":2,"lastUpdated":1736528276442}}},"actuators":{"actuators":{"currentFile":{"count":1,"lastUpdated":1736528278631}}},"Sensors":{"Sensors":{"currentFile":{"count":1,"lastUpdated":1736528280975}}},"state":{"state":{"currentFile":{"count":1,"lastUpdated":1736529437831}}},"types":{"types":{"currentFile":{"count":1,"lastUpdated":1736529458373}}},"Operatiosn":{"Operatiosn":{"currentFile":{"count":1,"lastUpdated":1736530551849}}},"Algorithms":{"Algorithms":{"currentFile":{"count":1,"lastUpdated":1736792441945}}},"Problem":{"Problem":{"currentFile":{"count":1,"lastUpdated":1736792504102}}},"parallel":{"parallel":{"currentFile":{"count":2,"lastUpdated":1736858881146}}},"processing":{"processing":{"currentFile":{"count":1,"lastUpdated":1736858379041}}},"resources":{"resources":{"currentFile":{"count":1,"lastUpdated":1736858873851}}},"Reduce":{"Reduce":{"currentFile":{"count":1,"lastUpdated":1736859169038}}}} \ No newline at end of file +{"algorithm":{"algorithm":{"currentFile":{"count":1,"lastUpdated":1736360369637}}},"computing":{"computing":{"currentFile":{"count":2,"lastUpdated":1736427522780}}},"tasks":{"tasks":{"currentFile":{"count":1,"lastUpdated":1736428160890}}},"parallelization":{"parallelization":{"currentFile":{"count":1,"lastUpdated":1736428239757}}},"Implicit":{"Implicit":{"currentFile":{"count":1,"lastUpdated":1736429811730}}},"Semi-implicit":{"Semi-implicit":{"currentFile":{"count":1,"lastUpdated":1736429857427}}},"Agent":{"Agent":{"currentFile":{"count":1,"lastUpdated":1736527234430}}},"Agents":{"Agents":{"currentFile":{"count":3,"lastUpdated":1736528265726}}},"actions":{"actions":{"currentFile":{"count":1,"lastUpdated":1736527553391}}},"successful":{"successful":{"currentFile":{"count":1,"lastUpdated":1736527687166}}},"agents":{"agents":{"currentFile":{"count":3,"lastUpdated":1736529446424}}},"environment":{"environment":{"currentFile":{"count":2,"lastUpdated":1736528276442}}},"actuators":{"actuators":{"currentFile":{"count":1,"lastUpdated":1736528278631}}},"Sensors":{"Sensors":{"currentFile":{"count":1,"lastUpdated":1736528280975}}},"state":{"state":{"currentFile":{"count":1,"lastUpdated":1736529437831}}},"types":{"types":{"currentFile":{"count":1,"lastUpdated":1736529458373}}},"Operatiosn":{"Operatiosn":{"currentFile":{"count":1,"lastUpdated":1736530551849}}},"Algorithms":{"Algorithms":{"currentFile":{"count":1,"lastUpdated":1736792441945}}},"Problem":{"Problem":{"currentFile":{"count":1,"lastUpdated":1736792504102}}},"parallel":{"parallel":{"currentFile":{"count":2,"lastUpdated":1736858881146}}},"processing":{"processing":{"currentFile":{"count":1,"lastUpdated":1736858379041}}},"resources":{"resources":{"currentFile":{"count":1,"lastUpdated":1736858873851}}},"Reduce":{"Reduce":{"currentFile":{"count":1,"lastUpdated":1736859169038}}},"minimized":{"minimized":{"currentFile":{"count":1,"lastUpdated":1736860208884}}},"oriented":{"oriented":{"currentFile":{"count":1,"lastUpdated":1736860250593}}},"Memory":{"Memory":{"currentFile":{"count":1,"lastUpdated":1736860492193}}}} \ No newline at end of file diff --git a/UNB/Year 5/Semester 2/CS4745/Lecture Notes.md b/UNB/Year 5/Semester 2/CS4745/Lecture Notes.md index f8ef3a4..670b7da 100644 --- a/UNB/Year 5/Semester 2/CS4745/Lecture Notes.md +++ b/UNB/Year 5/Semester 2/CS4745/Lecture Notes.md @@ -31,4 +31,11 @@ Stream of Messages -> Language Identification -> English Messages -> Metadata Re The time and process requirements of each task may differ, which introduces the need to load balance, as well as the concept of the bottleneck, which is the slowest task in the chain. Embarrassingly parallel: Problem which can be parallelized by simply allocating more hardware resources. ### Word Count with Map Reduce -Each thread can map a document of a word to a count, which after completion can be reduced to one map from each thread, usually with a parallel hash table. \ No newline at end of file +Each thread can map a document of a word to a count, which after completion can be reduced to one map from each thread, usually with a parallel hash table. + +## Memory Schemes +Multicore systems, ones which have the ability to compute multiple tasks at the same time in a shared memory environment are often latency oriented, with the start and stop time of results being minimized, as well as the time between results is minimized. + +Manycore systems, ones which are often a large number of cores tasked with the same problem, in a shared memory environment are often throughput oriented, with the amount computation being higher amortized over a period of time, or focusing on longer running tasks/computation. +### Distributed Memory +The tasks are not within the same memory space, and do not share memory addresses, and there is no need for communication between nodes \ No newline at end of file