Sciweavers

1074 search results - page 167 / 215
» Parallelizing post-placement timing optimization
Sort
View
JSSPP
2004
Springer
14 years 1 months ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan
HIPC
1999
Springer
13 years 12 months ago
Microcaches
We describe a radically new cache architecture and demonstrate that it offers a huge reduction in cache cost, size and power consumption whilst maintaining performance on a wide ra...
David May, Dan Page, James Irwin, Henk L. Muller
SPAA
1998
ACM
13 years 12 months ago
Lamport Clocks: Verifying a Directory Cache-Coherence Protocol
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...
Manoj Plakal, Daniel J. Sorin, Anne Condon, Mark D...
SPAA
1997
ACM
13 years 12 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
ICDCS
2007
IEEE
13 years 11 months ago
Understanding Instant Messaging Traffic Characteristics
Instant messaging (IM) has become increasingly popular due to its quick response time, its ease of use, and possibility of multitasking. It is estimated that there are several mil...
Zhen Xiao, Lei Guo, John M. Tracey