Topic
Parallelism (grammar)
About: Parallelism (grammar) is a research topic. Over the lifetime, 2812 publications have been published within this topic receiving 38354 citations. The topic is also known as: parallel structure & parallel construction.
Papers published on a yearly basis
1 / 2
Papers
[...]
IBM1
TL;DR: Deep Blue as discussed by the authors is the chess machine that defeated then-reigning World Chess Champion Garry Kasparov in a six-game match in 1997 and won the first World Chess Championship.
Abstract: Deep Blue is the chess machine that defeated then-reigning World Chess Champion Garry Kasparov in a six-game match in 1997. There were a number of factors that contributed to this success, including: a single-chip chess search engine, a massively parallel system with multiple levels of parallelism, a strong emphasis on search extensions, a complex evaluation function, and effective use of a Grandmaster game database. This paper describes the Deep Blue system, and gives some of the rationale that went into the design decision behind Deep Blue. Copyright 2001 Elsevier B.V.
1,375 citations
Book•
3 Jan 1990
1,045 citations
Proceedings Article•
1 Jan 1986
778 citations
1 Apr 1991
TL;DR: The results of simulations of 18 different test programs under 375 different models of available parallelism analysis are presented, showing how simulations based on instruction traces can model techniques at the limits of feasibility and even beyond.
Abstract: Growing interest in ambitious multiple-issue machines and heavilypipelined machines requires a careful examination of how much instructionlevel parallelism exists in typical programs. Such an examination is complicated by the wide variety of hardware and software techniques for increasing the parallelism that can be exploited, including branch prediction, register renaming, and alias analysis. By performing simulations based on instruction traces, we can model techniques at the limits of feasibility and even beyond. This paper presents the results of simulations of 18 different test programs under 375 different models of available parallelism analysis. This paper replaces Technical Note TN-15, an earlier version of the same material.
740 citations
Book•
1 Mar 1995
TL;DR: In this paper, the authors present the results of simulations of 18 different test programs under 375 different models of available parallelism analysis, including branch prediction, register renaming and alias analysis.
Abstract: Growing interest in ambitious multiple-issue machines and heavilypipelined machines requires a careful examination of how much instructionlevel parallelism exists in typical programs. Such an examination is complicated by the wide variety of hardware and software techniques for increasing the parallelism that can be exploited, including branch prediction, register renaming, and alias analysis. By performing simulations based on instruction traces, we can model techniques at the limits of feasibility and even beyond. This paper presents the results of simulations of 18 different test programs under 375 different models of available parallelism analysis. This paper replaces Technical Note TN-15, an earlier version of the same material.
592 citations
Performance Metrics
| Year | Papers |
|---|---|
| 2026 | 1 |
| 2025 | 148 |
| 2024 | 247 |
| 2023 | 260 |
| 2022 | 327 |
| 2021 | 107 |