Community Health Information Tracking System using Short Message Service (chitSMS) is an extension of CHITS which is a system that stores health records of patients in the barangay. Another project incorporated a mobi...
详细信息
In classical real-time systems the resources for an application are allocated at system start so that every resource request can be fulfilled in future. This would lead to much internal waste of resources in the case ...
详细信息
Community Health Information Tracking System using Short Message Service (chitSMS) is an extension of CHITS which is a system that stores health records of patients in the barangay. Another project incorporated a mobi...
详细信息
Community Health Information Tracking System using Short Message Service (chitSMS) is an extension of CHITS which is a system that stores health records of patients in the barangay. Another project incorporated a mobile component in CHITS, enabling the health worker to visit the patient, do routine check-ups and medical services, and update CHITS when the health worker returns to the health center. Without a remote connection, however, the health worker has to return frequently to the usually distant health center to update the CHITS database with the data gathered from the field consult. chitSMS addresses this by using SMS as a mode of remote data transfer. It ensures the reliable transmission of the data by implementing a modified selective repeat protocol. Furthermore, it performs the Deflate algorithm for compression of the data being sent to minimize the cost.
The participation of stationary computers with highbandwidth links in peer-to-peer content-distribution networks is highly popular. Mobile devices (e.g. cell phones), however, could not yet be launched into the field ...
详细信息
The participation of stationary computers with high-bandwidth links in peer-to-peer content-distribution networks is highly popular. Mobile devices (e.g. cell phones), however, could not yet be launched into the field...
详细信息
The participation of stationary computers with high-bandwidth links in peer-to-peer content-distribution networks is highly popular. Mobile devices (e.g. cell phones), however, could not yet be launched into the field to a satisfactory extent. This paper discusses mobile peer-to-peer approaches that cover this issue and compares two promising approaches in detail. The first approach supports mobile devices by adding new infrastructure elements to the mobile network operator's domain. In the second approach, voluntary peers provide support for mobile devices. Both approaches are able to foster the integration of mobile devices into peer-to-peer networks with a large user community.
In this paper, we evaluate and compare the performance of several spanning tree routing strategies for divisible load scheduling on arbitrary graphs and derive recommendations as to which routing strategy provides a b...
详细信息
ISBN:
(纸本)9781424449224;9781424449217
In this paper, we evaluate and compare the performance of several spanning tree routing strategies for divisible load scheduling on arbitrary graphs and derive recommendations as to which routing strategy provides a better trade-off between complexity and time performance. We consider a network comprising heterogeneous processors interconnected by heterogeneous links in an arbitrary manner. We evaluate the performance over a wide range of arbitrary dense graphs with varying connectivity and processor densities and study the effect of network scalability. In addition, we introduce a novel spanning tree routing strategy, which is referred to as minimum equivalent network spanning tree (EST), and analyze its performance. We apply the resource-aware optimal load distribution with optimal sequencing (RAOLD-OS) scheduling algorithm presented in the literature for obtaining an optimal solution. This study attempts to pool all known and applicable divisible load scheduling algorithms for arbitrary networks and presents a collective and comparative view of their performance.
In this paper, we propose a static scheduling algorithm forassigning tasks with precedence constraints onto a cluster of heterogeneoussensor nodes connected by a single-hop wireless network so as tomaximize the lifeti...
详细信息
ISBN:
(纸本)9783540898931
In this paper, we propose a static scheduling algorithm forassigning tasks with precedence constraints onto a cluster of heterogeneoussensor nodes connected by a single-hop wireless network so as tomaximize the lifetime of the sensor network. The processing element oneach sensor node is equipped with dynamic voltage scaling capability. Inour algorithm, we assign the tasks to the sensor nodes so as to minimizethe energy consumption of the tasks on each sensor node while keepingthe energy consumption as balanced as possible. We also propose an algorithmto generate a second schedule that can improve the lifetime ofthe network further when it is used together with the original *** observe up to 311% lifetime improvement in our simulations whenour algorithms are compared to the baseline case where dynamic voltagescaling is not used.
In designing energy-aware CPU scheduling algorithms for real-time embedded systems, dynamic slack reclamation techniques significantly improve system quality-of-service (QoS) and energy efficiency. However, the limite...
详细信息
ISBN:
(纸本)9781424419210
In designing energy-aware CPU scheduling algorithms for real-time embedded systems, dynamic slack reclamation techniques significantly improve system quality-of-service (QoS) and energy efficiency. However, the limited schemes in this domain either demand high complexity or can only achieve limited QoS. In this paper, we present a novel low complexity runtime scheduling algorithm for the imprecise computation (IC) modeled tasks. The target is to maximize system QoS under energy constraints. Our proposed algorithm, named gradient curve shifting (GCS), is able to decide the best allocation of slack cycles arising at runtime, with very low complexity. We study both linear and concave QoS functions associated with IC modelde tasks, on non-DVS and DVS processors. Furthermore, we apply the intra-task DVS technique to tasks and achieve as large as 18% more of the system QoS compared to the conventional "optimal" solution which is inter-task DVS based.
暂无评论