Sciweavers

2355 search results - page 76 / 471
» Scheduling in the Z-Polyhedral Model
Sort
View
IFIP
2010
Springer
13 years 4 months ago
Model Checking of Concurrent Algorithms: From Java to C
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...
Cyrille Artho, Masami Hagiya, Watcharin Leungwatta...
HPDC
2008
IEEE
14 years 4 months ago
The performance of bags-of-tasks in large-scale distributed systems
Ever more scientists are employing large-scale distributed systems such as grids for their computational work, instead of tightly coupled high-performance computing systems. Howev...
Alexandru Iosup, Omer Ozan Sonmez, Shanny Anoep, D...
CORR
2011
Springer
149views Education» more  CORR 2011»
13 years 5 months ago
General Iteration graphs and Boolean automata circuits
This article is set in the eld of regulation networks modeled by discrete dynamical systems. It focuses on Boolean automata networks. In such networks, there are many ways to upd...
Mathilde Noual
TON
2010
176views more  TON 2010»
13 years 4 months ago
Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
Martin Karsten
IPPS
1998
IEEE
14 years 2 months ago
Efficient Runtime Thread Management for the Nano-Threads Programming Model
Abstract. The nano-threads programming model was proposed to effectively integrate multiprogramming on shared-memory multiprocessors, with the exploitation of fine-grain parallelis...
Dimitrios S. Nikolopoulos, Eleftherios D. Polychro...