30 search results - page 3 / 6 » Improved Bounds for Flow Shop Scheduling |
GLVLSI
2000
IEEE
13 years 10 months ago
2000
IEEE
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...
ICNS
2007
IEEE
14 years 9 days ago
2007
IEEE
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...
TON
1998
13 years 5 months ago
1998
—We present a scheduling protocol, called time-shift scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a predet...
WSC
2000
13 years 7 months ago
2000
This paper discusses the use of simulation in a new context. Most often QUEST is viewed as a stand-alone simulation tool to analyze and understand shop floor behavior. It has rare...
ISCC
2005
IEEE
13 years 11 months ago
2005
IEEE
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model...