Sciweavers

5149 search results - page 370 / 1030
» Timed Asynchronous Distributed Systems
Sort
View
169
Voted
JSSPP
2007
Springer
15 years 11 months ago
QBETS: Queue Bounds Estimation from Time Series
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
Daniel Nurmi, John Brevik, Richard Wolski
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
15 years 8 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna
SIROCCO
2000
15 years 6 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...
GRID
2007
Springer
15 years 4 months ago
Data Management in the APPA System
Combining Grid and P2P technologies can be exploited to provide high-level data sharing in large-scale distributed environments. However, this combination must deal with two hard p...
Reza Akbarinia, Vidal Martins
RTAS
2010
IEEE
15 years 3 months ago
A Stochastic Framework for Multiprocessor Soft Real-Time Scheduling
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
Alex F. Mills, James H. Anderson