152,060 Hits in 4.8 sec

Modeling Resolution of Resources Contention in Synchronous Data Flow Graphs

Marco Lattuada, Fabrizio Ferrandi
2014 Journal of Signal Processing Systems  
To address this issue preserving the simplicity of the representation, techniques that model data transfer delays by means of ad-hoc actors have been proposed, but they model independently each communication  ...  Moreover, they do not usually consider at all delays due to buffer contentions, potentially overestimating the throughput of a design solution.  ...  and communication actors modeling communication delays; -Crossbar : it is the Without Communication Contention SDF graph enriched with actors modeling serialization of communications between each pair  ... 
doi:10.1007/s11265-014-0923-y fatcat:ikphwkdfrfc5rou75wz436fipi

Slotted contention-based energy-efficient MAC protocols in delay-sensitive wireless sensor networks

Messaoud Doudou, Djamel Djenouri, Nadjib Badache, Abdelmadjid Bouabdallah
2012 2012 IEEE Symposium on Computers and Communications (ISCC)  
Timeliness issues of slotted contention-based MAC protocols are dealt with in this paper, where a comprehensive review and taxonomy is provided.  ...  With asynchronous protocols, additional delay is needed for the sender to meet the receiver's active period.  ...  One critical issue with the synchronous wake-up protocols is how to deal with contentions and collisions to minimize the delay.  ... 
doi:10.1109/iscc.2012.6249332 dblp:conf/iscc/DoudouDBB12 fatcat:fzjyiqq34bcglpoprxrmhyxuqy

Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems

PengCheng Mu, Jean-François Nezan, Mickaël Raulet, Jean-Gabriel Cousin
2010 Science China Information Sciences  
Then the critical child technique improves the selection of a processor in the scheduling process. Finally, the communication delay technique enlarges the idle time intervals on communication links.  ...  This paper indeed aims at task scheduling with communication contention for parallel embedded systems and proposes three advanced techniques to improve the list scheduling heuristic.  ...  Acknowledgements This work was supported by the China Scholarship Council and the National Natural Science Foundation of China (Grant No. 60971113). We thank Profs.  ... 
doi:10.1007/s11432-010-4097-3 fatcat:y2ehrflbgfbipjni7f2xba6m7y

Exploiting Device-to-Device Communications to Enhance Spatial Reuse for Popular Content Downloading in Directional mmWave Small Cells

Yong Niu, Li Su, Chuhan Gao, Yong Li, Depeng Jin, Zhu Han
2016 IEEE Transactions on Vehicular Technology  
With the popularity of content-based mobile applications, popular content downloading in the small cells needs to be optimized to improve network performance and enhance user experience.  ...  Through extensive simulations under various traffic patterns, we demonstrate PCDS achieves near-optimal performance in terms of delay and throughput, and also superior performance compared with other existing  ...  In the algorithm, the AP and UEs that have received the content downloading packets are scheduled to be the downloading sources of the nearest UEs to fully exploit the advantages of D2D communications.  ... 
doi:10.1109/tvt.2015.2466656 fatcat:tncyqq3bpnc2fm5xbkyfhypdze

A Compound Scheduling Strategy for Irregular Array Redistribution in Cluster Based Parallel System [chapter]

Shih-Chang Chen, Ching-Hsien Hsu, Tai-Lung Chen, Kun-Ming Yu, Hsi-Ya Chang, Chih-Hsun Chou
2010 Lecture Notes in Computer Science  
In this paper, a two-step communication cost modification (T2CM) and a synchronization delay-aware scheduling heuristic (SDSH) are proposed to normalize the communication cost and reduce transmission delay  ...  With the advancement of network and techniques of clusters, joining clusters to construct a wide parallel system becomes a trend.  ...  1~11 The results with new dominators and cost Fig. 5 . 5 A result of proposed method with low synchronization delay and contention free Fig. 6 . 6 The results of both methods on five sets of nodes  ... 
doi:10.1007/978-3-642-14822-4_8 fatcat:b4quicqlm5h6ppdim4lw4czvtm

Distributed Scheduling in Input Queued Switches

A. Scicchitano, A. Bianco, P. Giaccone, E. Leonardi, E. Schiattarella
2007 2007 IEEE International Conference on Communications  
reduce the hardware complexity in very large, high-speed, switches.  ...  We propose a new scheduling algorithm, named SRR (Synchronous Round Robin), which is suited to a fully distributed implementation and provides good performance if compared with more complex, non fully  ...  ACKNOWLEDGMENT This work was performed in the framework of the Italian PRIN project BORA-BORA and partly supported by IBM under joint research contract no.93830515.  ... 
doi:10.1109/icc.2007.1048 dblp:conf/icc/ScicchitanoBGLS07 fatcat:juccvyl6lfgqhd2qxnkmc3pv24

Mapping DSP applications onto self-timed multiprocessors

S.S. Bhattacharyya, N. Bambha, M. Khandelia, V. Kianzad
2001 Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256)  
scheduling, communication synthesis, and power management of self-timed implementations.  ...  However, analysis and optimization of self-timed systems under real-time constraints is challenging due to the complex, irregular dynamics of self-timed operation.  ...  DAAL01-98-K-0075 and the MICRA program), and the Defense Advanced Research Projects Agency (MDA972-00-1-0023, through Brown University).  ... 
doi:10.1109/acssc.2001.986965 fatcat:vlwdmst5ebbqrhc2vzkyscspou

Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems

2011 Scientia Sinica Informationis  
Acknowledgements This work was supported by the China Scholarship Council. We thank Profs. YIN QinYe of Xi'an Jiaotong University for giving precious propositions during the redaction of this paper.  ...  Node and Edge Scheduling with communication delay Our methods of node and edge scheduling differ from those of the classic one by using the As Late As Possible (ALAP) start time to delay communications  ...  Task Scheduling with Communication Contention A schedule of a DAG is the association of a start time and a processor with each node of the DAG.  ... 
doi:10.1360/zf2011-41-3-349 fatcat:3jc5p6fhu5gudiotlqlinmvdjm

Communication contention in task scheduling

O. Sinnen, L.A. Sousa
2005 IEEE Transactions on Parallel and Distributed Systems  
Hence, contention for communication resources is not considered in task scheduling, yet it has a strong influence on the execution time of a parallel program.  ...  The contention awareness is accomplished by scheduling the communications, represented by the edges in the task graph, onto the links of the topology graph.  ...  This work was partially supported by Portuguese Foundation for Science and Technology (FCT) through Program FEDER, by FCT and FSE (Fundo Social Europeu) in the context of III European Framework of Support  ... 
doi:10.1109/tpds.2005.64 fatcat:oxqmg6hy7rb3ldf53nazmn7ljy

Resource Allocation for Device-to-Device Communications Underlaying Cellular Networks

Tao He, Xinquan Ye, Lieying Luo
2013 International Journal of Signal Processing, Image Processing and Pattern Recognition  
Then, we propose a scheduling-based resource allocation that has the advantage of low scheduling overhead in addition to providing a common design for under the in-network coverage and out-of-network coverage  ...  There are two possibilities for D2D resource allocation: contention-based resource allocation and scheduling-based resource allocation. In this paper, these resource allocation schemes are analyzed.  ...  Acknowledgements This work was supported by Natural Science Foundation of China (11372229, 71271156, 71301120), and Education Department of Zhejiang Province (Z201120727, Y201224800).  ... 
doi:10.14257/ijsip.2016.9.5.17 fatcat:v3bcfvmsz5g5hmbbvdxbg7n2ay

Tightening Contention Delays While Scheduling Parallel Applications on Multi-core Architectures

Benjamin Rouxel, Steven Derrien, Isabelle Puaut
2017 ACM Transactions on Embedded Computing Systems  
An Integer Linear Programming (ILP) solution of the scheduling problem is presented, as well as a heuristic solution that generates schedules very close to ones of the ILP (5 % longer on average), with  ...  Based on knowledge of the application's structure, our scheduling strategies precisely estimate the effective contentions, in order to minimize the overall makespan of the schedule.  ...  Updating the schedule to cope with interference Each time a task is added, new interferences caused by the addition of the task in the schedule must be added, and the delay of some communication phases  ... 
doi:10.1145/3126496 fatcat:2tsxukoozzcanljtctee7wyh7u

Schedulability Analysis under Graph Routing in WirelessHART Networks

Abusayeed Saifullah, Dolvara Gunatilaka, Paras Tiwari, Mo Sha, Chenyang Lu, Bo Li, Chengjie Wu, Yixin Chen
2015 2015 IEEE Real-Time Systems Symposium  
The proposed analysis can be used to quickly assess the schedulability of real-time flows with stringent requirements on both reliability and latency.  ...  While these mechanisms are critical for reliable communication, they introduce substantial challenges in analyzing the schedulability of real-time flows.  ...  Thus the two links v → a and w → a are scheduled sequentially, on slot 6 and slot 7, respectively. Impact of transmission conflict on channel contention delay.  ... 
doi:10.1109/rtss.2015.23 dblp:conf/rtss/SaifullahGTSLLW15 fatcat:aqfq2zprtbdptcbrmrulji3y4a

NSOSS: the non-synchronized optical switch simulator

Miklos Kozlovszky, Tibor Berceli, Viktor Kozlovszky
2007 Proceedings of the 2nd International ICST Conference on Performance Evaluation Methodologies and Tools  
Contention resolution of optical signals in time and space domain plays crucial role in optical communication.  ...  The realized simulator follows the behaviour of a multi-port/multi-wavelength DWDM switching module, where the contention resolution problem is solved with buffers made from fiber delay lines (FDLs).  ...  Scheduler Schedules messages based on scheduling algorithm, and send them to the corresponding output gates.  ... 
doi:10.4108/nstools.2007.2022 dblp:conf/valuetools/KozlovszkyBK07 fatcat:s65gdtaq2vf77m5jcjbff5uoce

On Task Scheduling Accuracy: Evaluation Methodology and Results

Oliver Sinnen, Leonel Sousa
2004 Journal of Supercomputing  
The node n i [ V is associated with one task i of the modeled program and the edge e ij [ E (with n i ; n j [ V) is associated with the communication from task i to task j.  ...  Most of these algorithms apply a simple model of the target system that assumes fully connected processors, a dedicated communication sub-system and no contention for the communication resources.  ...  Acknowledgments The authors would like to acknowledge the support of the European Commission through ARI grant number HPRI-CT-1999-00026 and through TMR grant number ERB FMGE CT950051 (the TRACS program  ... 
doi:10.1023/b:supe.0000009321.92150.64 fatcat:mw4tluz7l5bz5f6uzrkzbcv7ze

WiSec 2011 demo

Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt, Vincent Lenders
2011 ACM SIGMOBILE Mobile Computing and Communications Review  
We demonstrate that RFReact is both powerful and versatile with a jamming system that can demodulate the header of an IEEE 802.15.4 packet, decide whether to jam it based on its content, and carry out  ...  the decision all while the packet is still on the air.  ...  choice) with minimal delay, or even to overshadow parts of transmissions in order to manipulate the content of packets without affecting their timing.  ... 
doi:10.1145/2073290.2073300 fatcat:savxmo5vtrhjtivav3ego52tfm
« Previous Showing results 1 — 15 out of 152,060 results