Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ashoke Deb

dblp:27/1669 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1996
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems › memory architecture
interleaved memory
0.011996
Multiskewing-A Novel Technique for Optimal Parallel Memory Access · IEEE Trans. Parallel Distributed Syst. 1996
Memory systems › memory interference
memory bank conflicts
0.011996
Multiskewing-A Novel Technique for Optimal Parallel Memory Access · IEEE Trans. Parallel Distributed Syst. 1996
Memory systems › memory access
parallel memory access
0.011996
Multiskewing-A Novel Technique for Optimal Parallel Memory Access · IEEE Trans. Parallel Distributed Syst. 1996
Memory systems
skewing scheme
0.011996
Multiskewing-A Novel Technique for Optimal Parallel Memory Access · IEEE Trans. Parallel Distributed Syst. 1996
YearPublicationVenuePosition
1996 Multiskewing-A Novel Technique for Optimal Parallel Memory Access
abstract
The disparity between the processing speed and the data access rates presents a serious bottleneck in pipelined/vector processors. The memory bank conflict in interleaved system can be alleviated by skewing, for scientific computations performing functions on varieties of submatrices. So far uniskewing involving periodic and linear functions have been studied. Several difficulties encountered in such schemes are that they require a prime number of memory modules, may create wasted memory space, or addressing functions and the alignment network become complex. We present a new technique, termed multiskewing, which applies multiple functions on different sections of the array. Each of these functions may be as simple as a linear shift. We show that some of the advantages are that it does not require a prime number of memory, memory utilization factor is 100%, maintains the logical structure of the array, and allows optimal memory access of a large class of submatrices.
Ashoke Deb
IEEE Trans. Parallel Distributed Syst.1
1980 Conflict-Free Access of Arrays - A Counter Example
Ashoke Deb
Inf. Process. Lett.1