Sciweavers

294 search results - page 52 / 59
» Concurrency and the Principle of Data Locality
Sort
View
81
Voted
PPOPP
2009
ACM
15 years 10 months ago
Detecting and tolerating asymmetric races
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
Paruj Ratanaworabhan, Martin Burtscher, Darko Kiro...
PDP
2011
IEEE
14 years 1 months ago
Quantifying Thread Vulnerability for Multicore Architectures
Abstract—Continuously reducing transistor sizes and aggressive low power operating modes employed by modern architectures tend to increase transient error rates. Concurrently, mu...
Isil Oz, Haluk Rahmi Topcuoglu, Mahmut T. Kandemir...
163
Voted
POPL
2008
ACM
15 years 9 months ago
Foundations for structured programming with GADTs
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
Patricia Johann, Neil Ghani
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
14 years 10 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
BMCBI
2008
139views more  BMCBI 2008»
14 years 9 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu