1205 search results - page 161 / 241 » On P Systems with Bounded Parallelism |
123
Voted
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
149
Voted
ISCAPDCS
2003
15 years 4 months ago
2003
In modern computer systems loops present a great deal of opportunities for increasing Instruction Level and Thread Level Parallelism. Loop unrolling is a technique used to obtain ...
181
Voted
HPDC
2011
IEEE
14 years 7 months ago
2011
IEEE
We investigate proactive dynamic load balancing on multicore systems, in which threads are continually migrated to reduce the impact of processor/thread mismatches to enhance the ...
133
Voted
SODA
2010
ACM
16 years 29 days ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
131
Voted
ICPADS
2008
IEEE
15 years 10 months ago
2008
IEEE
It is common that Internet service hosting centres use several logical pools to assign server resources to different applications, and that they try to achieve the highest total r...