Parallel Tasks Research Articles

Coarse Grained Task Parallelization by Dynamic Profiling for Heterogeneous SoC Based Embedded System

In this study, we introduce a methodology for automatically transforming user applications written in C/C++ to a parallel representation consisting of coarse-grained tasks based on dynamic profiling. Such a parallel representation is suitable for mapping applications onto heterogeneous SoCs. We present our approach for instrumenting the user application binary during the compilation process with parallel primitives that enable the runtime system to schedule and execute independent computation-intensive coarse-grained tasks concurrently. We use the proposed compilation and code transformation methodology to retarget each application for execution on a heterogeneous SoC composed of processor cores and accelerators. We demonstrate the capabilities of our integrated compile time and runtime flow through task-level parallelization and functionally correct execution of real-world applications in the communication systems and radar processing domains. We demonstrate the functionality of our integrated system by executing six distinct applications with different degrees of parallelism on four different platforms: an eight-core general-purpose processor, a heterogeneous SoC simulator, and two heterogeneous SoCs utilizing the Xilinx Zynq UltraScale+ FPGA and the Nvidia Jetson AGX board. Our integrated approach offers a path forward for application developers to take full advantage of the target SoC without requiring users to become hardware or parallel programming experts.

Adaptive memory reservation strategy for heavy workloads in the Spark environment

The rise of the Internet of Things (IoT) and Industry 2.0 has spurred a growing need for extensive data computing, and Spark emerged as a promising Big Data platform, attributed to its distributed in-memory computing capabilities. However, practical heavy workloads often lead to memory bottleneck issues in the Spark platform. This results in resilient distributed datasets (RDD) eviction and, in extreme cases, violent memory contentions, causing a significant degradation in Spark computational efficiency. To tackle this issue, we propose an adaptive memory reservation (AMR) strategy in this article, specifically designed for heavy workloads in the Spark environment. Specifically, we model optimal task parallelism by minimizing the disparity between the number of tasks completed without blocking and the number completed in regular rounds. Optimal memory for task parallelism is determined to establish an efficient execution memory space for computational parallelism. Subsequently, through adaptive execution memory reservation and dynamic adjustments, such as compression or expansion based on task progress, the strategy ensures dynamic task parallelism in the Spark parallel computing process. Considering the cost of RDD cache location and real-time memory space usage, we select suitable storage locations for different RDD types to alleviate execution memory pressure. Finally, we conduct extensive laboratory experiments to validate the effectiveness of AMR. Results indicate that, compared to existing memory management solutions, AMR reduces the execution time by approximately 46.8%.

Bimodal aphasia and dysgraphia: Phonological output buffer aphasia and orthographic output buffer dysgraphia in spoken and sign language

We report a case of crossmodal bilingual aphasia -- aphasia in two modalities, spoken and sign language-- and dysgraphia in both writing and fingerspelling. The patient, Sunny, was a 42 year-old woman, after a left temporo-parietal stroke, a speaker of Hebrew, Romanian, and English and an adult learner, daily user of Israeli Sign language (ISL).We assessed Sunny’s spoken and sign languages using a comprehensive test battery of naming, reading, and repetition tasks, and also analysed her spontaneous-speech and sign. Her writing and fingerspelling were assessed using tasks of dictation, naming, and delayed copying.In spoken language production, Sunny showed a classical phonological output buffer (POB) impairment in naming, reading, repetition, and spontaneous production, with phonological errors (transpositions, substitutions, insertions, and omissions) in words and pseudo-words, and whole-unit errors in morphological affixes, function-words, and number-words, with a length effect. Importantly, her error pattern in ISL was remarkably similar in the parallel tasks, with phonological errors in signs and pseudo-signs, affecting all the phonological parameters of the sign (movement, handshape, location, and orientation), and whole-unit errors in morphemes, function-signs, and number-signs. Sunny’s impairment was selective to the POB, without phonological input, semantic-conceptual, or syntactic deficits. This shows for the first time how POB impairment, a kind of conduction aphasia, manifests itself in a sign language, and indicates that the POB for sign-language has the same cognitive architecture as the one for spoken language. It may also indicate similar neural underpinnings for spoken and sign languages.In writing, Sunny forms the first case of a selective type of dysgraphia in fingerspelling, orthographic (graphemic) output buffer dysgraphia. In both writing and fingerspelling, she made letter errors (letter transpositions, substitutions, insertions, and omissions), as well as morphological errors and errors in function words, and showed length effect. Sunny’s impairment was selective to the orthographic output buffer, whereas her reading, including orthographic input processing, was intact. This suggests that the orthographic output buffer is shared for writing and in fingerspelling, at least in a late learner of sign language. The results shed further light on the architecture of phonological and orthographic production.

There Is More to Avatars Than Visuals: Investigating Combinations of Visual and Auditory User Representations for Remote Collaboration in Augmented Reality

Supporting remote collaboration through augmented reality facilitates the experience of co-presence by presenting the collaborator’s avatar in the user’s physical environment. While visual user representations are continuously researched and advanced, the audio configuration – especially in combination with different visualizations – is rarely considered. In a user study (n = 48, 24 dyads), we evaluate the combination of two visual (Simple vs. Rich Avatar) with two auditory (Mono vs. Spatial Audio) user representations, to investigate their impact on user’s overall experience, performance, and perceived social presence during collaboration. Our results show a preference for rich auditory and visual user representations, as Spatial Audio supports completion of parallel tasks and the Rich Avatar positively influence user experience. However, the Simple Avatar draws less attention, which potentially benefits task efficiency, advocating for simpler visualizations in performance-oriented settings. Our findings contribute to a deeper understanding of how visual and auditory user representation combinations impact remote collaboration in augmented reality.

Photonic reservoir computing for parallel task processing based on a feedback-free spin-polarized VCSEL

Time delayed reservoir computing (RC) is a novel artificial neural network that is easy to implement in hardware due to its extremely simple structure. Because of its time-division multiplexed information processing, laser-based photonic time-delayed RCs usually realize parallel processing with polarization/wavelength multiplexing. However, the performance of two different tasks is difficult to regulate separately and simultaneously in the time delayed RC system, especially for the chip-scale configuration. Here, we propose a feedback-free RC system based on a spin-polarized vertical-cavity surface-emitting semiconductor laser (VCSEL), which simplifies the whole system structure and can process time series prediction and waveform recognition tasks in parallel, with employing the input and output coding to provide the effect from past states. By separately setting the number of past states introduced by the coding for the two tasks, the performance of the two tasks can be adjusted respectively. Furthermore, by appropriately tuning the pump polarization ellipticity which is the unique feature for the spin-polarized VCSEL, the computational ability of the proposed RC can be focused on one of the two parallel tasks. Therefore, the proposed RC system is capable of dealing with different tasks with high performance, and also expected to provide a viable solution for integrated neuromorphic computing systems due to its compact, feedback-free structure.

Research on Parallel Task Scheduling Algorithm of SaaS Platform Based on Dynamic Adaptive Particle Swarm Optimization in Cloud Service Environment

To efficiently realize the parallel task scheduling of SaaS platform in large-scale cloud service environment, this paper studies the parallel task scheduling algorithm of SaaS platform based on dynamic adaptive particle swarm optimization in cloud service environment. Users access the cloud through the user access interface module, and issue task scheduling instructions or send task scheduling requests. After the service management module provides diversified application service support according to the scheduling requirements, the core service module determines the SaaS platform parallel scheduling objective function, and uses dynamic adaptive particle swarm optimization to solve the objective function to obtain the SaaS platform parallel task scheduling results. The test results show that the algorithm has better multi-objective solving ability and can obtain higher quality objective solutions, and the test results of the total execution time of parallel scheduling tasks and the total transmission time of task data on SaaS platform are all within 30 s. The results of virtual machine resource load balancing degree are all below 15%; the utilization rate of virtual machine resources is above 92.2%.

Artificial potential field-empowered dynamic holographic optical tweezers for particle-array assembly and transformation

Owing to the ability to parallel manipulate micro-objects, dynamic holographic optical tweezers (HOTs) are widely used for assembly and patterning of particles or cells. However, for simultaneous control of large-scale targets, potential collisions could lead to defects in the formed patterns. Herein we introduce the artificial potential field (APF) to develop dynamic HOTs that enable collision-avoidance micro-manipulation. By eliminating collision risks among particles, this method can maximize the degree of parallelism in multi-particle transport, and it permits the implementation of the Hungarian algorithm for matching the particles with their target sites in a minimal pathway. In proof-of-concept experiments, we employ APF-empowered dynamic HOTs to achieve direct assembly of a defect-free 8 × 8 array of microbeads, which starts from random initial positions. We further demonstrate successive flexible transformations of a 7 × 7 microbead array, by regulating its tilt angle and inter-particle spacing distances with a minimalist path. We anticipate that the proposed method will become a versatile tool to open up new possibilities for parallel optical micromanipulation tasks in a variety of fields.

Better together: Automated app review analysis with deep multi-task learning

Context:User reviews of mobile apps provide an important communication channel between developers and users. Existing approaches to automated app review analysis mainly focus on one task (e.g., bug classification task, information extraction task, etc.) at a time, and are often constrained by the manually defined patterns and the ignorance of the correlations among the tasks. Recently, multi-task learning (MTL) has been successfully applied in many scenarios, with the potential to address the limitations associated with app review mining tasks. Objective:In this paper, we propose MABLE, a deep MTL-based and semantic-aware approach, to improve app review analysis by exploiting task correlations. Methods:MABLE jointly identifies the types of involved bugs reported in the review and extracts the fine-grained features where bugs might occur. It consists of three main phases: (1) data preparation phase, which prepares data to allow data sharing beyond single task learning; (2) model construction phase, which employs a BERT model as the shared representation layer to capture the semantic meanings of reviews, and task-specific layers to model two tasks in parallel; (3) model training phase, which enables eavesdropping by shared loss function between the two related tasks. Results:Evaluation results on six apps show that MABLE outperforms ten commonly-used and state-of-the-art baselines, with the precision of 79.76% and the recall of 79.24% for classifying bugs, and the precision of 79.83% and the recall of 80.33% for extracting problematic app features. The MTL mechanism improves the F-measure of two tasks by 3.80% and 4.63%, respectively. Conclusion:The proposed approach provides a novel and effective way to jointly learn two related review analysis tasks, and sheds light on exploring other review mining tasks.

Optimization of office process task allocation based on deep reinforcement learning

In office platforms, we often need to face the situation of a large number of parallel heterogeneous process tasks. This not only tests the ability of the task executors themselves, but also puts forward requirements for the performance of the collaborative scheduling system. Using the reinforcement learning method, combined with quantitative analysis such as collaborative coordination and slackness, and based on the Markov Bollinger theory, a multi-agent Bollinger model is proposed to realize the optimization scheduling system with overall process coordination and maximum completion time as the optimization objectives, thereby improving the overall execution efficiency. Taking the real business system process as the test scenario, under the same optimization objective, the reinforcement learning algorithm based on D3QN and DRL and the meta-heuristic algorithm based on ant colony are compared to verify the effectiveness of the proposed method.

On the degree of parallelism for parallel real-time tasks

The degree of parallelism, which measures how a task can execute concurrently, is an important characterization in scheduling. This paper studies the degree of parallelism in the domain of real-time scheduling of parallel tasks, including the DAG task model and the conditional DAG task model. The definition of the degree of parallelism for DAG tasks is clarified; the definition and computing algorithm of the degree of parallelism for conditional DAG tasks are proposed. By leveraging the degree of parallelism, new response time bounds are derived and simple but effective real-time scheduling approaches are presented. This research is the first work to study the degree of parallelism for conditional DAG tasks and explore its benefits in real-time scheduling. Experimental results demonstrate that the proposed scheduling approaches significantly outperform existing state-of-the-art methods.

Scheduling multi-skill technicians and reassignable tasks in a cloud computing company

We investigate a multi-skill technician and reassignable task scheduling problem in a cloud computing company. In the problem, multi-skill technicians are assigned to process a large number of tasks from customer requests in a certain scheduling horizon. The tasks are allowed to be reassigned to another technician multiple times, and one technician can process multiple tasks in parallel. The company not only focuses on processing efficiency, but also expects to improve customers’ experience and technicians’ satisfaction. We characterize the feasible solutions and introduce a weighted objective with three metrics: processing efficiency, response delay, and workload balance. An effective two-stage hierarchical optimization method embedded in a greedy randomized adaptive search procedure framework is proposed. In the first stage, initial solutions are generated by a greedy randomized construction procedure, and then improved by local search with an ejection chain operator to optimize processing efficiency. In the second stage, two local search procedures with five operators for improving response delay or workload balance are designed. Computational experiments are conducted to evaluate the effectiveness of our algorithm. The results show that the proposed algorithm is competent in fast computing a schedule of high quality. It also reveals that reassignments are helpful in reducing response delay and balancing workloads in the scheduling.

Unveiling the influence of persuasion strategies on cognitive engagement: an ERPs study on attentional search.

This study aimed to investigate how central versus peripheral persuasion methods, delivered through rational and emotional persuasion strategies, influence cognitive engagement and information processing during visual search tasks. Participants were allocated into four groups based on the media type (video vs. text) and the persuasion route (central vs. peripheral). The early and late stages of attentional processing were examined through the N1, P2, and P3 ERP components. The results demonstrated a pronounced N1 amplitude in response to text-based peripheral persuasion, indicating enhanced early attentional engagement. Additionally, parallel search tasks revealed a larger P3 amplitude for central versus peripheral routes, suggesting significant cognitive resource allocation during tasks requiring higher attention. These findings underscore the nuanced role of persuasive strategies in modulating attentional resources and cognitive processing. The study offers insights into designing more effective communication messages and highlights the potential for tailored persuasion approaches to influence audience engagement and information processing, with implications for public health campaigns and beyond.

Magnetic Torque-Driven All-Terrain Microrobots.

All-terrain microrobots possess significant potential in modern medical applications due to their superior maneuverability in complex terrains and confined spaces. However, conventional microrobots often struggle with adaptability and operational difficulties in variable environments. This study introduces a magnetic torque-driven all-terrain multiped microrobot (MTMR) to address these challenges. By coupling the structure's multiple symmetries with different uniform magnetic fields, such as rotating and oscillating fields, the MTMR demonstrates various locomotion modes, including rolling, tumbling, walking, jumping, and their combinations. Experimental results indicate that the robot can navigate diverse terrains, including flat surfaces, steep slopes (up to 75°), and gaps over twice its body height. Additionally, the MTMR performs well in confined spaces, capable of passing through slits (0.1 body length) and low tunnels (0.25 body length). The robot shows potential for clinical applications like minimally invasive hemostasis in internal bleeding and thrombus removal from blood vessels through accurate cargo manipulation capability. Moreover, the MTMR can carry temperature sensors to monitor environmental temperature changes in real time while simultaneously manipulating objects, displaying its potential for in-situ sensing and parallel task implementation. This all-terrain microrobot technology demonstrates notable adaptability and versatility, providing a solid foundation for practical applications in interventional medicine.

Resting-state functional connectivity involved in tactile orientation processing

BackgroundGrating orientation discrimination (GOD) is commonly used to assess somatosensory spatial processing. It allows discrimination between parallel and orthogonal orientations of tactile stimuli applied to the fingertip. Despite its widespread application, the underlying mechanisms of GOD, particularly the role of cortico-cortical interactions and local brain activity in this process, remain elusive. Therefore, we aimed to investigate how a specific cortico-cortical network and inhibitory circuits within the primary somatosensory cortex (S1) and secondary somatosensory cortex (S2) contribute to GOD. MethodsIn total, 51 healthy young adults were included in our study. We recorded resting-state magnetoencephalography (MEG) and somatosensory-evoked magnetic field (SEF) in participants with open eyes. We converted the data into a source space based on individual structural magnetic resonance imaging. Next, we estimated S1- and S2-seed resting-state functional connectivity (rs-FC) at the alpha and beta bands through resting-state MEG using the amplitude envelope correlation method across the entire brain (i.e., S1/S2-seeds × 15,000 vertices × two frequencies). We assessed the inhibitory response in the S1 and S2 from SEFs using a paired-pulse paradigm. We automatically measured the GOD task in parallel and orthogonal orientations to the index finger, applying various groove widths with a custom-made device. ResultsWe observed a specific association between the GOD threshold (all P < 0.048) and the alpha rs-FC in the S1–superior parietal lobule and S1–adjacent to the parieto-occipital sulcus (i.e., lower rs-FC values corresponded to higher performance). In contrast, no association was observed between the local responses and the threshold. DiscussionThe results of this study underpin the significance of specific cortico-cortical networks in recognizing variations in tactile stimuli.

Research on image compression technology based on improved SPIHT compression algorithm for power grid data

Abstract At present, the amount of information on power grid operation and maintenance monitoring image data is increasing, and the requirements for data compression are higher and higher. Based on the improved SPIHT image compression algorithm, this study presents the research of power grid data compression. First, the basic theory of image compression, and the principle of one-dimensional wavelet transform and two-dimensional wavelet transform are introduced. The development process, characteristics, and advantages of image coding are discussed. Then, the shortcomings of the SPIHT algorithm are analyzed, and the SPIHT coding is improved by parallel computation. The parallel wavelet transform algorithm based on the block idea and the parallel SPIHT coding algorithm based on the code tree are proposed in the data parallelism of the compression algorithm. At the same time, the data dependence between tasks in the process of SPIHT image compression coding is analyzed, and the task parallelism in the compression algorithm is realized by using the relative independence of tasks in different threshold coding. Finally, the application and simulation analysis of power grid data based on the SPIHT compression algorithm, the construction of power grid data model simulation, and the composition of two-dimensional power grid data images are carried out. Secondly, the obtained 2D power grid data image is compressed by the SPIHT algorithm and improved SPIHT algorithm, respectively, and the compression effect of the two algorithms on the power grid data image is compared. When the bit rate is 0.5, the compression effect of the improved SPIHT algorithm is 13.6506. When the bit rate is 1, the compression effect of the improved SPIHT algorithm is 18.9287. The results show that the improved SPIHT algorithm can compress the grid data to obtain better grid image quality.

Hybrid Sensor Fusion Mixed with Reinforcement Learning in Autonomous Dual-Arm Lifting Tasks Performed by Humanoid Robots

Humanoid robots often struggle with tasks such as lifting objects due to the complexity involved in identifying contact points, applying the correct force, and tracking task progress. We propose an integrated solution that leverages the dual-arm capability of humanoids and utilizes sensor fusion from vision and force sensors. Our system employs a computer vision algorithm to detect and characterize object properties (shape, size, position, orientation) and differentiate between parallel and non-parallel bi-manipulation tasks. The controller then identifies optimal contact points for the end effectors, generating trajectories fed into a closed-loop controller using force feedback. For parallel bi-manipulation, momentum cancellation is achieved through sensor fusion. For non-parallel surfaces, a reinforcement learning algorithm determines the appropriate lifting force to prevent slippage using only two contact points. Experimental validation on a real humanoid platform demonstrates the effectiveness of our approach in autonomously lifting objects, regardless of contact surface configuration. This advancement significantly enhances the reliability and versatility of humanoid robots in performing complex manipulation tasks, contributing to their practical deployment in human-oriented environments.

The analysis of educational informatization management learning model under the internet of things and artificial intelligence

This study explores the influence of the Internet of Things (IoT) and Artificial Intelligence (AI)-enhanced learning models on student management in educational informatization management. A game-theoretic enhanced learning model is proposed to achieve this objective, incorporating resource scheduling strategies under fog computing and a student management system that integrates IoT and AI technologies. This model’s performance and the student management system are then tested. The results indicate that the fog computing-based hierarchical Q-learning (Q) model proposed in this study achieves faster convergence than a single Q model, reaching convergence after 80 training rounds, ten rounds earlier than the comparative algorithm. The model exhibits a lower average workload delay of 0.5 ms and fog node delay below 1 ms, showcasing significant advantages in terms of overall cost-effectiveness, thus minimizing service costs. The student management system has 3000 concurrent user connections, static page request times ranging from 0 to 25 s, login response time predominantly at 60 s, and a capacity to process up to 20 parallel tasks per second with zero errors. The system functionalities are fully realized, meeting usage demands effectively and achieving the highest average functional score of 9.03 for online interaction functionality. This study demonstrates the efficacy of the game-theoretic enhanced learning model in a fog computing environment and the positive impact of IoT and AI technologies on student management. The proposed student management system better caters to individual student needs, enhancing learning outcomes and experiences. The study's innovation lies in the integration of IoT technology with AI-enhanced learning models, coupled with the introduction of game-theoretic resource scheduling strategies, enabling the student management system to intelligently identify student requirements, allocate learning resources, and dynamically optimize the educational process, ultimately improving learning outcomes. This holds significant implications for enhancing education quality and promoting personalized student development.

High-quality implementation for a continuous-in-time financial API in C#

In recent years, there has been a rising interest in potentially complex software and financial industries with applications in many engineering fields. With this rise comes a host of developing a usable and consistent Application Programming Interface (API). Prioritize designing and building the software ensures to enrich the platform and emphasize inventorying APIs. In this paper, we proposed a high-quality API to implement the continuous-in-time financial model. The existing discrete framework cannot be evaluated at any time period, involving drawbacks in operating the data structures. Then, the continuous framework is implemented based on the measure theory paradigm. Our proposal uses mathematical modeling, which consists of some objects as measures and fields. It is suitable to develop this API in C# to provide the requirement quality in programming language professionally. This also integrates demands, codes, and verification in the system development life cycle. The advantages are aimed at increasing the structuring and readability. The presented work provides an overview of the design, implementation, testing, and delivery aspects of the API, highlighting the importance of architecture, testing, and numerical choices. The article gives an overview of the API by describing the implementation concerning the data structures and algorithms. These algorithms are based on using the Task Parallel Library (TPL) that makes the API easier and more fruitful for data parallel to benefit from the advantages provided by the .NET Framework.

MURE: Multi-layer real-time livestock management architecture with unmanned aerial vehicles using deep reinforcement learning

In recent years, the combination of unmanned aerial vehicles (UAVs) and wireless sensor networks (WSNs) has gained popularity in livestock management (LM) due to energy constraints and network instability. Limited energy storage of sensor nodes (SNs) and the possibility of packet loss contribute to fast energy consumption and unstable networks, respectively. UAVs serve as relay nodes and data sinks, addressing these issues by temporarily storing data to reduce SN workload and establishing mobile nodes for network stability. We propose two innovations based on previous work: 1) We introduce a multi-layer wireless network architecture, categorizing UAVs into two layers based on their functions including data collection and data processing. This enhances task parallelization, bridging performance gaps among multiple UAVs; 2) We overcome the mobility limitation of SNs, considering their real-time movement in the network. Through deep reinforcement learning, UAVs learn to cooperatively locate moving SNs. This accounts for the inevitable mobility of livestock in the industry. Additionally, we simulate the environment and compare our approach to traditional methods, evaluating metrics such as collected data per timestep (DCPS), energy consumed per timestep (ECPS), and network stability (NS). Experimental results demonstrate that our method outperforms traditional approaches, achieving a data collecting gain of 4.84% and 8.20% compared to the methods without considering SN mobility or the multi-layer characteristics of WSNs, respectively. Under energy consumption limits, our method yields energy savings of 3.00% and 1.35% respectively. Furthermore, we extensively study and validate our method against other path planning algorithms, including genetic particle swarm optimization (GPSO), modified central force optimization (MCFO), and rapidly-exploring random trees (RRT). Our approach surpasses these methods in terms of data collecting efficiency and network stability.

A many-to-many matching with externalities solution for parallel task offloading in IoT networks

The efficient and timely execution of tasks is a fundamental challenge in the realm of future Internet of Things (IoT) networks. To address this challenge, fog devices are often deployed close to end devices to facilitate task processing on behalf of IoT nodes. One strategy for improving task computational delay is to employ parallel task offloading, in which tasks are subdivided into subtasks and sent to different fog devices for execution in parallel. However, allocating computational resources to fog nodes and mapping these resources to IoT subtasks is a key challenge in this area. This work models the parallel task offloading problem as a graph-matching problem and utilizes a many-to-many matching technique to achieve a stable mapping of IoT subtasks to fog node resources. Unfortunately, the proposed solution is subject to the problem of externalities due to the dynamic preference profiling of fog nodes. To address this issue, we employ an iterative algorithm to resolve any blocking pairs that may arise. Our results demonstrate that the proposed technique reduces the task latency by 29% as compared to other matching-based techniques available in the literature.