Sciweavers

4889 search results - page 798 / 978
» A Refactoring Approach to Parallelism
Sort
View
SPAA
2006
ACM
16 years 13 days ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
VRCAI
2006
ACM
16 years 13 days ago
Parallel-split shadow maps for large-scale virtual environments
Shadowing effects dramatically enhance the realism of virtual environments by providing useful visual cues. Shadow mapping is an efficient algorithm for real-time shadow renderin...
Fan Zhang, Hanqiu Sun, Leilei Xu, Lee Kit Lun
ICDCS
2005
IEEE
16 years 3 days ago
ReDAL: Request Distribution for the Application Layer
Modern application infrastructures are based on clustered, multi-tiered architectures, where request distribution occurs in two sequential stages: over a cluster of web servers, a...
Debra E. VanderMeer, Helen M. Thomas, Kaushik Dutt...
IEEEPACT
2005
IEEE
16 years 3 days ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
IPPS
2005
IEEE
16 years 2 days ago
A Dependency Chain Clustered Microarchitecture
In this paper we explore a new clustering approach for reducing the complexity of wide issue in-order processors based on EPIC architectures. Complexity effectiveness is achieved ...
Satish Narayanasamy, Hong Wang 0003, Perry H. Wang...