Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Explicit multi-threading

Explicit Multi-Threading ( XMT ) is a computer science paradigm for building and programming parallel computers designed around the Parallel Random… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Title of dissertation: POWER AND PERFORMANCE STUDIES OF THE EXPLICIT MULTI-THREADING (XMT) ARCHITECTURE Fuat Keceli, Doctor of… Expand
2011
2011
The Explicit Multi-Threading (XMT) is a general-purpose many-core computing platform, with the vision of a 1000-core chip that is… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 5
  • figure 4
2009
2009
We present a lock-free version of the light-weight userlevel task management library called Wool, in an aim to show that even… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2008
2008
Title of thesis: A HIGH-THROUGHPUT, LOW-POWER ASYNCHRONOUS MESH-OF-TREES INTERCONNECTION NETWORK FOR THE EXPLICIT MULTI-THREADING… Expand
2008
2008
With the end of exponential performance improvements in sequential computers, parallel computers, dubbed "chip multiprocessor… Expand
2007
2007
We develop an algebraic theory of threads, synchronous cooperation of threads and interaction of threads with Maurer machines… Expand
  • table 3
  • table 4
  • table 5
  • table 7
  • table 8
2001
2001
The upcoming so-called "on-chip Billion transistor" era raises the question: What to do with all the on-chip hardware once the… Expand
2000
2000
Algorithms for the problem of list ranking are empiricallystudied with respect to the Explicit Multi-Threaded (XMT) platformfor… Expand
  • figure 2
1999
1999
Algorithms for the problem of list ranking are empirically studied with respect to the Explicit Multi-Threaded (XMT) platform for… Expand
Highly Cited
1998
Highly Cited
1998
This paper envisions an extension to a standard instruction set which efficiently implements PRAM-style algorithms using explicit… Expand
  • figure 1
  • figure 2
  • figure 3