Sciweavers

1257 search results - page 93 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
INFOCOM
2012
IEEE
13 years 4 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis
IJES
2006
110views more  IJES 2006»
15 years 1 months ago
Partitioning bin-packing algorithms for distributed real-time systems
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...
Dionisio de Niz, Raj Rajkumar
104
Voted
IPPS
2010
IEEE
14 years 11 months ago
Oblivious algorithms for multicores and network of processors
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
Rezaul Alam Chowdhury, Francesco Silvestri, Brando...
IPPS
2003
IEEE
15 years 7 months ago
Grid Harvest Service: A System for Long-Term, Application-Level Task Scheduling
With the emergence of grid computing environment, performance measurement, analysis and prediction of non-dedicated distributed systems have become increasingly important. In this...
Xian-He Sun, Ming Wu
CN
2006
99views more  CN 2006»
15 years 1 months ago
High-performance switching based on buffered crossbar fabrics
As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained ...
Lotfi Mhamdi, Mounir Hamdi, Christopher Kachris, S...