Reviews

Introduction Accelerated Critical Sections (ACS) Trade-offs Trade-off #1 Trade-off #2 Trade-off #3 Trade-off #4 Comparison: ACS vs SCMP Conclusion Introduction In the paper, “Accelerating Critical Section Execution with Asymmetric Multi-Core Architectures,” the authors, Suleman, Mutlu, Qureshi, and Patt, essentially concern themselves with the problem popularly revealed in Amdahl’s law, \[ \operatorname{speedup}(N) = \frac{1}{1 - P + \frac{P}{N}}, \] where \(\operatorname{speedup}\) is the total execution time of a single-threaded version of a program divided by the total execution time an \(N\)-threaded implementation of the same program.

In [1], the authors present a method for constructing a symbolic (nominal) representation for real-valued time series data. A symbolic representation is desirable because then it becomes possible to use many of the effective algorithms that require symbolic representation, like hashing and Markov models.