Sciweavers

79 search results - page 13 / 16
» Asynchronous Distributed Searchlight Scheduling
Sort
View
EAAI
2007
154views more  EAAI 2007»
13 years 7 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
ICS
1995
Tsinghua U.
13 years 11 months ago
On the Utility of Threads for Data Parallel Programming
Threads provide a useful programming model for asynchronous behavior because of their ability to encapsulate units of work that can then be scheduled for execution at runtime, bas...
Thomas Fahringer, Matthew Haines, Piyush Mehrotra
TPDS
2008
116views more  TPDS 2008»
13 years 7 months ago
A Dynamic Skip List-Based Overlay for On-Demand Media Streaming with VCR Interactions
Media distribution through application-layer overlay networks has received considerable attention recently, owing to its flexible and readily deployable nature. On-demand streaming...
Dan Wang, Jiangchuan Liu
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 8 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
CCGRID
2010
IEEE
13 years 8 months ago
FaReS: Fair Resource Scheduling for VMM-Bypass InfiniBand Devices
In order to address the high performance I/O needs of HPC and enterprise applications, modern interconnection fabrics, such as InfiniBand and more recently, 10GigE, rely on network...
Adit Ranadive, Ada Gavrilovska, Karsten Schwan