Browsing Singapore-MIT Alliance (SMA) by Author "Leiserson, Charles E."
Now showing items 1-7 of 7
-
Adversarial Analyses of Window Backoff Strategies for Simple Multiple-Access Channels
Bender, Michael A.; Farach-Colton, Martin; He, Simai; Kuszmaul, Bradley C.; Leiserson, Charles E. (2004-01)Backoff strategies have typically been analyzed by making statistical assumptions on the distribution of problem inputs. Although these analyses have provided valuable insights into the efficacy of various backoff strategies, ... -
Hardware Transactional Memory
Lie, Sean; Asanovic, Krste; Kuszmaul, Bradley C.; Leiserson, Charles E. (2004-01)This work shows how hardware transactional memory (HTM) can be implemented to support transactions of arbitrarily large size, while ensuring that small transactions run efficiently. Our implementation handles small ... -
A Media Player for Use in Distance Education
Huang, Kai; Leiserson, Charles E.; Sarmenta, Luis F.G. (2004-01)We have developed a media player for use in distance education. The player can incorporate several time-indexed sources, including video, audio, PowerPoint, and text index. We have converted all the SMA 5503 Introduction ... -
On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs
Bender, Michael A.; Fineman, Jeremy T.; Gilbert, Seth; Leiserson, Charles E. (2005-01)A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two algorithms, one serial and one ... -
Programming with Exceptions in JCilk
Danaher, John S.; Lee, I-Ting Angelina; Leiserson, Charles E. (2006-01)JCilk extends the Java language to provide call-return semantics for multithreading, much as Cilk does for C. Java's built-in thread model does not support the passing of exceptions or return values from one thread back ... -
Provably Efficient Adaptive Scheduling for Parallel Jobs
He, Yuxiong; Hsu, Wen Jing; Leiserson, Charles E. (2007-01)Scheduling competing jobs on multiprocessors has always been an important issue for parallel and distributed systems. The challenge is to ensure global, system-wide efficiency while offering a level of fairness to user ... -
Transactions Everywhere
Kuszmaul, Bradley C.; Leiserson, Charles E. (2003-01)Arguably, one of the biggest deterrants for software developers who might otherwise choose to write parallel code is that parallelism makes their lives more complicated. Perhaps the most basic problem inherent in the ...