Sciweavers

9325 search results - page 352 / 1865
» The decentralized implementability problem
Sort
View
ICC
2007
IEEE
102views Communications» more  ICC 2007»
15 years 11 months ago
Distributed Scheduling in Input Queued Switches
— Dealing with RTTs (Round Trip Time) in IQ switches has been recently recognized as a challenging problem, especially if considering distributed (multi-chip) scheduler implement...
Alessandra Scicchitano, Andrea Bianco, Paolo Giacc...
KBSE
2007
IEEE
15 years 11 months ago
Inferring structural patterns for concern traceability in evolving software
As part of the evolution of software systems, effort is often invested to discover in what parts of the source code a feature (or other concern) is implemented. Unfortunately, kn...
Barthélémy Dagenais, Silvia Breu, Fr...
ICSM
2000
IEEE
15 years 9 months ago
ConSIT: A Conditioned Program Slicer
Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including re-use, ree...
Chris Fox, Mark Harman, Robert M. Hierons, Sebasti...
WDAG
1994
Springer
104views Algorithms» more  WDAG 1994»
15 years 8 months ago
Fast Increment Registers
We give an optimal, wait-free implementation of an increment register. An increment register is a concurrent object consisting of an integer-valued register with an increment oper...
Soma Chaudhuri, Mark R. Tuttle
HIPC
2007
Springer
15 years 8 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri