Sciweavers

608 search results - page 64 / 122
» Time Space Sharing Scheduling and Architectural Support
Sort
View
LCTRTS
2001
Springer
14 years 1 months ago
A Dynamic Programming Approach to Optimal Integrated Code Generation
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...
Christoph W. Keßler, Andrzej Bednarski
DAC
2004
ACM
14 years 2 months ago
Extending the transaction level modeling approach for fast communication architecture exploration
System-on-Chip (SoC) designs are increasingly becoming more complex. Efficient on-chip communication architectures are critical for achieving desired performance in these systems....
Sudeep Pasricha, Nikil D. Dutt, Mohamed Ben-Romdha...
TCOM
2008
92views more  TCOM 2008»
13 years 8 months ago
Mailbox switch: a scalable two-stage switch architecture for conflict resolution of ordered packets
Abstract-- Traditionally, conflict resolution in an inputbuffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only nee...
Cheng-Shang Chang, Duan-Shin Lee, Ying-Ju Shih, Ch...
HT
2004
ACM
14 years 2 months ago
Dynamically growing hypertext collections
Many approaches have been pursued over the years to facilitate creating, organizing, and sharing collections of materials extracted from large information spaces. Little attention...
Pratik Dave, Paul Logasa Bogen II, Unmil Karadkar,...
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
13 years 3 months ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs