scholarly journals Handling multiple language contexts by subtractive context switching

Author(s):  
M. Loberbauer
Keyword(s):  
2020 ◽  
Vol 19 (2) ◽  
pp. 159-162
Author(s):  
Ferdous Sharifi ◽  
Nezam Rohbani ◽  
Shaahin Hessabi

2009 ◽  
Vol 23 (7) ◽  
pp. 735-744 ◽  
Author(s):  
Darcy S. Reisman ◽  
Robert Wityk ◽  
Kenneth Silver ◽  
Amy J. Bastian

Background and Objective. Following stroke, subjects retain the ability to adapt interlimb symmetry on the split-belt treadmill. Critical to advancing our understanding of locomotor adaptation and its usefulness in rehabilitation is discerning whether adaptive effects observed on a treadmill transfer to walking over ground. We examined whether aftereffects following split-belt treadmill adaptation transfer to overground walking in healthy persons and those poststroke. Methods. Eleven poststroke and 11 age-matched and gender-matched healthy subjects walked over ground before and after walking on a split-belt treadmill. Adaptation and aftereffects in step length and double support time were calculated. Results. Both groups demonstrated partial transfer of the aftereffects observed on the treadmill ( P < .001) to overground walking ( P < .05), but the transfer was more robust in the subjects poststroke ( P < .05). The subjects with baseline asymmetry after stroke improved in asymmetry of step length and double limb support ( P = .06). Conclusions. The partial transfer of aftereffects to overground walking suggests that some shared neural circuits that control locomotion for different environmental contexts are adapted during split-belt treadmill walking. The larger adaptation transfer from the treadmill to overground walking in the stroke survivors may be due to difficulty adjusting their walking pattern to changing environmental demands. Such difficulties with context switching have been considered detrimental to function poststroke. However, we propose that the persistence of improved symmetry when changing context to overground walking could be used to advantage in poststroke rehabilitation.


2021 ◽  
Vol 8 (4) ◽  
pp. 75-81
Author(s):  
Ahmed A. Alsheikhy ◽  

In real-time systems, a task or a set of tasks needs to be executed and completed successfully within a predefined time. Those systems require a scheduling technique or a set of scheduling methods to distribute the given task or the set of tasks among different processors or on a processor. In this paper, a new novel scheduling approach to minimize the overhead from context switching between several periodic tasks is presented. This method speeds up a required response time while ensuring that all tasks meet their deadline times and there is no deadline miss occurred. It is a dynamic-priority technique that works either on a uniprocessor or several processors. In particular, it is proposed to be applied on multiprocessor environments since many applications run on several processors. Various examples are presented within this paper to demonstrate its optimality and efficiency. In addition, several comparison experiments with an earlier version of this approach were performed to demonstrate its efficiency and effectiveness too. Those experiments showed that this novel approach sped up the execution time from 15% to nearly around 46%. In addition, it proved that it reduced the number of a context switch between tasks from 12% to around 50% as shown from simulation tests. Furthermore, this approach delivered all tasks/jobs successfully and ensured there was no deadline miss happened.


2021 ◽  
Vol 14 (3) ◽  
pp. 1-25
Author(s):  
Arif Sasongko ◽  
I. M. Narendra Kumara ◽  
Arief Wicaksana ◽  
Frédéric Rousseau ◽  
Olivier Muller

The confidentiality and integrity of a stream has become one of the biggest issues in telecommunication. The best available algorithm handling the confidentiality of a data stream is the symmetric key block cipher combined with a chaining mode of operation such as cipher block chaining (CBC) or counter mode (CTR). This scheme is difficult to accelerate using hardware when multiple streams coexist. This is caused by the computation time requirement and mainly by management of the streams. In most accelerators, computation is treated at the block-level rather than as a stream, making the management of multiple streams complex. This article presents a solution combining CBC and CTR modes of operation with a hardware context switching. The hardware context switching allows the accelerator to treat the data as a stream. Each stream can have different parameters: key, initialization value, state of counter. Stream switching was managed by the hardware context switching mechanism. A high-level synthesis tool was used to generate the context switching circuit. The scheme was tested on three cryptographic algorithms: AES, DES, and BC3. The hardware context switching allowed the software to manage multiple streams easily, efficiently, and rapidly. The software was freed of the task of managing the stream state. Compared to the original algorithm, about 18%–38% additional logic elements were required to implement the CBC or CTR mode and the additional circuits to support context switching. Using this method, the performance overhead when treating multiple streams was low, and the performance was comparable to that of existing hardware accelerators not supporting multiple streams.


Sign in / Sign up

Export Citation Format

Share Document