kbendick commented on a change in pull request #3801:
URL: https://github.com/apache/iceberg/pull/3801#discussion_r775774386
##########
File path: core/src/test/java/org/apache/iceberg/hadoop/TestCachingCatalog.java
##########
@@ -257,6 +264,44 @@ public void
testCacheExpirationEagerlyRemovesMetadataTables() throws IOException
catalog.cache().asMap().containsKey(metadataTable)));
}
+ @Test
+ @Ignore("reproduces https://github.com/apache/iceberg/issues/3791";)
+ public void testDeadlock() throws IOException, InterruptedException {
+ HadoopCatalog underlyingCatalog = hadoopCatalog();
+ TestableCachingCatalog catalog =
TestableCachingCatalog.wrap(underlyingCatalog, Duration.ofSeconds(1), ticker);
+ Namespace namespace = Namespace.of("db", "ns1", "ns2");
+ int numThreads = 20;
Review comment:
Would it make sense to use fewer threads, so the space for collision /
hitting the deadlock is smaller? And then iterating like you are a few extra
times (so possibly switching to a different fixed threadpool)? This way the
`Random.nextInt` calls are more likely to collide and we don't have to spawn so
many threads.
Or even just creating two tables and then calling Random.nextInt(2) 20
times, which is highly likely to collide and use the same value twice in a row.
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
