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

Dan Trock

dblp:85/5543 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2024
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › pattern mining
association rule mining
0.012003
A High-Performance Distributed Algorithm for Mining Association Rules · ICDM 2003
Data mining › pattern mining › association rule mining
distributed association rule mining
0.012003
A High-Performance Distributed Algorithm for Mining Association Rules · ICDM 2003
Parallel and multicore computing
parallel data mining
0.012003
A High-Performance Distributed Algorithm for Mining Association Rules · ICDM 2003

Methods — techniques the papers use, named apart from their topics

single-scan mining · 0.1distributed algorithm · 0.1
YearPublicationVenuePosition
2024 Deterministic In-Fleet Scan Test for a Cloud Computing Platform
abstract
Recently the semiconductor industry has been alerted by hyperscaler companies reporting impact of field errors in megascale datacenters. They tend to be elusive and very difficult to detect until they affect a particular application several days or months after the IC has been deployed in a fleet. Although the cause of such errors can be manifold, ranging from test escapes and design marginalities to design bugs, there is a consensus across the industry that they usually can be traced back to timing-related issues, as the performance of transistors changes over time or at certain environmental conditions while running specific software workloads. While there is ongoing work to study some of those defects and to explore techniques preventing such post-manufacturing test escapes, it also highlights the need for IC monitoring so that such defects are detected in the field, thereby reducing application failures. The paper demonstrates a successful application of the Streaming Scan Network technology to run in-fleet deterministic scan test on an ultralarge industrial multi-chiplet design at Amazon Web Services (AWS) cloud computing platform. One of the key advantages of the presented technology is its ability to use the same infrastructure to perform both manufacturing and in-field tests. A silicon implementation along with test power analysis are also presented.
Dan Trock, Subramanian Mahadevan, Nilanjan Mukherjee 0001, Lee Harrison, Janusz Rajski, Jerzy Tyszer
ITC1
2016 Recursive hierarchical DFT methodology with multi-level clock control and scan pattern retargeting
Dan Trock, Rick Fisette
DATE1
2005 A high-performance distributed algorithm for mining association rules
Assaf Schuster, Ran Wolff 0001, Dan Trock
Knowl. Inf. Syst.3
2003 A High-Performance Distributed Algorithm for Mining Association Rules
abstract
We present a new distributed association rule mining (D-ARM) algorithm that demonstrates superlinear speedup with the number of computing nodes. The algorithm is the first D-ARM algorithm to perform a single scan over the database. As such, its performance is unmatched by any previous algorithm. Scale-up experiments over standard synthetic benchmarks demonstrate stable run time regardless of the number of computers. Theoretical analysis reveals a tighter bound on error probability than the one shown in the corresponding sequential algorithm.
Assaf Schuster, Ran Wolff 0001, Dan Trock
ICDM3