Improving the Performance of IEEE 802.11e with an Advanced Scheduling Heuristic

Author(s):  
Burak Simsek ◽  
Katinka Wolter
2010 ◽  
Vol E93-B (10) ◽  
pp. 2833-2836
Author(s):  
Sung-Rok YOON ◽  
Min Li HUANG ◽  
Sangho SEO ◽  
Hiroshi OCHI ◽  
Sin-Chong PARK

2013 ◽  
Vol E96.B (2) ◽  
pp. 639-642
Author(s):  
Kang Yong LEE ◽  
Jinsul KIM ◽  
Kee Seong CHO ◽  
Won RYU ◽  
Ho-Jin LEE
Keyword(s):  

1995 ◽  
Vol 05 (04) ◽  
pp. 575-586
Author(s):  
BEN LEE ◽  
ALI R. HURSON

The issue of scalability is key to the success of massively parallel processing. Due to their distributed nature, message-passing multicomputers are appropriate for achieving scalar performance. However, the message-passing model lacks programmability due to difficulties encountered by the programmers to partition and schedule the computation over the processors and to establish efficient inter-processor communication in the user code. Therefore, this paper presents a compile-time scheduling heuristic, called BLS, that maps programs onto the processors of a message-passing multicomputer. In contrast to other methods proposed, BLS takes a more global approach in attempt to balance the tradeoff between exploiting parallelism and reducing communication overhead. To evaluate the effectiveness of BLS, simulation studies of scheduling SISAL programs are presented.


2004 ◽  
Vol 22 (10) ◽  
pp. 2095-2106 ◽  
Author(s):  
Z. Kong ◽  
D.H.-K. Tsang ◽  
B. Bensaou ◽  
D. Gao

2005 ◽  
Vol 9 (6) ◽  
pp. 508-510 ◽  
Author(s):  
A. Banchs ◽  
L. Vollero

Sign in / Sign up

Export Citation Format

Share Document