Sciweavers

405 search results - page 2 / 81
» A Parallel Priority Data Structure with Applications
Sort
View
JPDC
2006
111views more  JPDC 2006»
13 years 5 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
ICDCS
2000
IEEE
13 years 9 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...
INFOCOM
2007
IEEE
13 years 11 months ago
Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...
Hao Wang, Bill Lin
ISPDC
2010
IEEE
13 years 3 months ago
Operational Semantics of the Marte Repetitive Structure Modeling Concepts for Data-Parallel Applications Design
—This paper presents an operational semantics of the repetitive model of computation, which is the basis for the repetitive structure modeling (RSM) package defined in the stand...
Abdoulaye Gamatié, Vlad Rusu, Éric R...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 3 months ago
Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
Fangwen Fu, Mihaela van der Schaar