13 Questions 12 Answers 0 Followers
Questions related from Masab Ahmad
Assume a memory access bound workload such as graph analytics, machine learning, monte-carlo simulations etc. Assume a high-end single chip GPU of the current generation (2020).
22 February 2020 4,532 3 View
This latency is going to be used to calculate the latency of a global barrier occurring across all cores across sockets.
22 February 2020 6,570 1 View
Works such as Mi6, InvisiSpec, and IRONHIDE, and many other works, target secure isolation of target processes. How do these works rank and work in terms of performance, complexity, and usability?
01 May 2019 9,019 2 View
Bayesian inference is a machine learning model not as widely used as deep learning or regression models. Why is it not as widely used and how does it compare to highly used models?
29 April 2019 4,505 10 View
Automation of various jobs is underway. What types of machine learning algorithms are used to replace human work?
20 April 2019 7,004 4 View
Intel's SGX extensions create isolated application enclaves, which disallow information leakage and unverified access to private data. However, SGX is now known to be broken as some works have...
19 March 2019 4,208 3 View
Nvidia has a larger market share of GPU sales. What are the reasons for this larger share?
19 March 2019 9,767 2 View
Quantum computers are known to run at least a couple of applications better than conventional computers. When a quantum computer does come about to exist, how will applications be switched in and...
19 March 2019 307 0 View
Quantum computers are known to perform extremely well on a limited number of problems at this time. For real applications, such as path planning and search in graph analytics, are quantum...
04 March 2019 3,100 2 View
Current parallel BFS algorithms are known to have reduced time complexity. However, such cases do not take into account synchronization costs which increase exponentially with the core count. Such...
26 February 2019 5,000 3 View
Synchronization and memory costs are becoming humongous bottlenecks in today's architectures. However, algorithm complexities assume these operations as constant, which are done in O(1) time. What...
26 February 2019 3,291 4 View
Graph algorithms such as BFS and SSSP (Bellman-Ford or Dijkstra's algorithm) generally exhibit a lack of locality. A vertex at the start of the graph may want to update an edge that exists in a...
26 February 2019 2,335 2 View
Dijkstra's algorithm performs the best sequentially on a single CPU core. Bellman-Ford implementations and variants running on the GPU outperform this sequential Dijkstra case, as well as parallel...
23 February 2019 4,108 1 View
