Sciweavers

362 search results - page 15 / 73
» Mechanizing and Improving Dependency Pairs
Sort
View
PLDI
2004
ACM
14 years 28 days ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
HPCA
2011
IEEE
12 years 11 months ago
Dynamic parallelization of JavaScript applications using an ultra-lightweight speculation mechanism
As the web becomes the platform of choice for execution of more complex applications, a growing portion of computation is handed off by developers to the client side to reduce net...
Mojtaba Mehrara, Po-Chun Hsu, Mehrzad Samadi, Scot...
EMNLP
2009
13 years 5 months ago
Recognizing Implicit Discourse Relations in the Penn Discourse Treebank
We present an implicit discourse relation classifier in the Penn Discourse Treebank (PDTB). Our classifier considers the context of the two arguments, word pair information, as we...
Ziheng Lin, Min-Yen Kan, Hwee Tou Ng
NSDI
2004
13 years 9 months ago
SWAP: A Scheduler with Automatic Process Dependency Detection
We have developed SWAP, a system that automatically detects process dependencies and accounts for such dependencies in scheduling. SWAP uses system call history to determine possi...
Haoqiang Zheng, Jason Nieh
HPCA
2000
IEEE
13 years 12 months ago
Memory Dependence Speculation Tradeoffs in Centralized, Continuous-Window Superscalar Processors
We consider a variety of dynamic, hardware-based methods for exploiting load/store parallelism, including mechanisms that use memory dependence speculation. While previous work ha...
Andreas Moshovos, Gurindar S. Sohi