Sciweavers

1901 search results - page 118 / 381
» Models and Scheduling Mechanisms for Global Computing Applic...
Sort
View
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
15 years 6 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
CLUSTER
2004
IEEE
15 years 5 months ago
A comparison of local and gang scheduling on a Beowulf cluster
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
Peter E. Strazdins, John Uhlmann
SOFTWARE
2011
14 years 8 months ago
Object-Oriented Parallelisation of Java Desktop Programs
Developing parallel applications is notoriously difficult, but is even more complex for desktop applications. The added difficulties are primarily because of their interactive nat...
Nasser Giacaman, Oliver Sinnen
MOBIQUITOUS
2005
IEEE
15 years 7 months ago
A SIP-based Architecture model for Contextual Coalition Access Control for Ubiquitous Computing
A significant deterrent to the ability to connect in a spontaneous manner in cross-enterprise collaborative applications is the difficulty in users from different domains being ab...
Ramiro Liscano, Kaining Wang
CPAIOR
2004
Springer
15 years 7 months ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel