You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.
The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.
For the reports in this repository we specifically note that
- the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
- the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
- technical reports and other articles issued by MÃ¤lardalen University is free for personal use. For other use, the explicit consent of the authors is required
- in other cases, please contact the copyright owner for detailed information
By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.
If you are in doubt, feel free to contact email@example.com
Non-traditional ways for inter-task communication
Philippas Tsigas and Håkan Sundell, Chalmers University of Technology
Turing Conference Room
Non-blocking implementation of shared data objects is a new alternative approach
for the problem of inter-task communication. Non-blocking mechanisms allow multiple
tasks to access a shared object at the same time, but without enforcing mutual
exclusion to accomplish this. Non-blocking inter-task communication does not
allow one task to block another task gives significant advantages over lock-based
* it does not give priority inversion, avoids lock convoys that make scheduling
analysis hard and delays longer.
* it provides high fault tolerance (processor failures will never corrupt shared
data objects) and eliminates deadlock scenarios from two or more tasks both
waiting for locks held by the other.
* and more significantly it completely eliminates the interference between process
schedule and synchronisation.
In this talk we would like to present part of our research on designing,
analysing and evaluating the performance of non-blocking implementations on
real-time and/or multiprocessor systems.