Sciweavers

2372 search results - page 402 / 475
» Probabilistic calling context
Sort
View
PPOPP
2010
ACM
14 years 5 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
14 years 4 months ago
Factor cuts
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
PPOPP
2010
ACM
14 years 2 months ago
Thread to strand binding of parallel network applications in massive multi-threaded systems
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
Petar Radojkovic, Vladimir Cakarevic, Javier Verd&...
IEEESCC
2007
IEEE
14 years 2 months ago
Web Services Security and Privacy
eb services are becoming widely deployed to implement the automation of business processes such as supply chain management, inventory tracking, and healthcare management, just to ...
Patrick C. K. Hung, Casey K. Fung
OOPSLA
2007
Springer
14 years 2 months ago
Component nextgen: a sound and expressive component framework for java
Developing a general component system for a statically typed, object-oriented language is a challenging design problem for two reasons. First, mutually recursive references across...
James Sasitorn, Robert Cartwright