Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5421267> ?p ?o }
Showing triples 1 to 29 of
29
with 100 triples per page.
- Q5421267 subject Q7470461.
- Q5421267 subject Q8713595.
- Q5421267 abstract "Explicit Multi-Threading ( XMT ) is a computer science paradigm for building and programming parallel computers designed around the Parallel Random Access Machine (PRAM) parallel computational model. A more direct explanation of XMT starts with the rudimentary abstraction that made serial computing simple: that any single instruction available for execution in a serial program executes immediately. A consequence of this abstraction is a step-by-step (inductive) explication of the instruction available next for execution. The rudimentary parallel abstraction behind XMT, dubbed Immediate Concurrent Execution (ICE) in Vishkin (2011), is that indefinitely many instructions available for concurrent execution execute immediately. A consequence of ICE is a step-by-step (inductive) explication of the instructions available next for concurrent execution. Moving beyond the serial von Neumann computer (the only successful general purpose platform to date), the aspiration of XMT is that computer science will again be able to augment mathematical induction with a simple one-line computing abstraction.The random access machine (RAM) is an abstract machine model used in computer science to study algorithms and complexity for standard serial computing. The PRAM computational model is an abstract parallel machine model that had been introduced to similarly study parallel algorithms and complexity for parallel computing, when they were yet to be built. Researchers have developed a large body of knowledge of parallel algorithms for the PRAM model. These parallel algorithms are also known for being simple, by standards of other approaches to parallel algorithms. This large body of parallel algorithms knowledge for the PRAM model and their relative simplicity motivated building computers whose programming can be guided by these parallel algorithms. Since productivity of parallel programmers has long been considered crucial for the success a parallel computer, simplicity of algorithms is important.Multi-core computers are built around two or more processor cores integrated on a single integrated circuit die. They are widely used across many application domains including general-purpose computing.Explicit Multi-Threading (XMT) is a computing paradigm for building and programming multi-core computers with tens, hundreds or thousands of processor cores.Experimental work published in 2011 and 2012 demonstrates significantly greater speedups for advanced PRAM algorithms on XMT prototypes than for the same problems on state-of-the-art multi-core computers.The XMT paradigm was introduced by Uzi Vishkin.".
- Q5421267 wikiPageExternalLink classnotes.pdf.
- Q5421267 wikiPageExternalLink spaa01-j-03.pdf.
- Q5421267 wikiPageExternalLink fulltext.
- Q5421267 wikiPageExternalLink CompFrontiers08.pdf.
- Q5421267 wikiPageExternalLink spaa98.ps.
- Q5421267 wikiPageExternalLink index.shtml.
- Q5421267 wikiPageWikiLink Q1754095.
- Q5421267 wikiPageWikiLink Q189088.
- Q5421267 wikiPageWikiLink Q21198.
- Q5421267 wikiPageWikiLink Q230655.
- Q5421267 wikiPageWikiLink Q232661.
- Q5421267 wikiPageWikiLink Q2565212.
- Q5421267 wikiPageWikiLink Q2585642.
- Q5421267 wikiPageWikiLink Q2902363.
- Q5421267 wikiPageWikiLink Q4390447.
- Q5421267 wikiPageWikiLink Q5295.
- Q5421267 wikiPageWikiLink Q555032.
- Q5421267 wikiPageWikiLink Q7470461.
- Q5421267 wikiPageWikiLink Q7661887.
- Q5421267 wikiPageWikiLink Q7665689.
- Q5421267 wikiPageWikiLink Q787114.
- Q5421267 wikiPageWikiLink Q7905027.
- Q5421267 wikiPageWikiLink Q814194.
- Q5421267 wikiPageWikiLink Q8713595.
- Q5421267 comment "Explicit Multi-Threading ( XMT ) is a computer science paradigm for building and programming parallel computers designed around the Parallel Random Access Machine (PRAM) parallel computational model. A more direct explanation of XMT starts with the rudimentary abstraction that made serial computing simple: that any single instruction available for execution in a serial program executes immediately.".
- Q5421267 label "Explicit multi-threading".