检索结果-内蒙古大学图书馆

11th IEEE International Conference on Embedded and real-time computing Systems and Applications

作者： Lin, Hsin-Hung Hsueh, Chih-Wen Real-Time Systems Laboratory Department of Computer Science and Information Engineering National Chung Cheng University Chiayi 621 Taiwan

ISBN: (纸本)0769523463

Energy consumption is a critical design issue in embedded systems, especially in battery-operated systems. Maintaining high performance while extending the battery life is an interesting challenge for system designers. Dynamic voltage scaling and dynamic frequency scaling allow us to adjust supply voltage and processor frequency to adapt to the workload demand for better energy management. Because of the high complexity involved, most solutions depend on heuristics for online power-aware real-time scheduling or offline time-consuming scheduling. In this paper, we discuss how we can apply pinwheel model to power-aware real-time scheduling so that task information, including start times, finish times, preemption times, etc, can be efficiently derived using pinwheel model. System predictability is thus increased and under better control on power-awareness. However, job execution time may be only a small portion of its worst case execution time and can only be determined at runtime. We implement a profiling tool to insert codes for collecting runtime information of real-time tasks. Worst case execution time is updated online for scheduler to perform better rescheduling according to actual execution. Simulations have shown that at most 50% energy can be saved by the proposed scheduling algorithm. Moreover, at most additional 33% energy can be saved when the profiling technique is applied. © 2005 IEEE.

关键词： real time systems

来源：评论

学校读者我要写书评

暂无评论

Distributed mining of partial periodic patterns in sequences

Distributed mining of partial periodic patterns in sequences

引用

作者： Hsiao, Han-Wen Tsai, Meng-Shu Tsai, Jeffrey J. P. Department of Computer Science and Information Engineering Asia University Taiwan Taiwan Institute of Information Technology Asia University Taiwan Taiwan Department of Computer Science University of Illinois Chicago United States Taichung Healthcare and Management University Department of Computer Science and Information Engineering Department of Biotechnology and Bioinformatics Department of Electrical Engineering and Computer Science University of Illinois Chicago Distributed Real-Time Intelligent Systems Laboratory

It has been an important task of discovering frequent fragments as particular patterns from large sequence databases generated from a variety of applications. In general, the patterns to be discovered may partially and asynchronously exist in sequences, and even contain gaps. In addition, it is necessary to collect the information regarding the locations and frequencies of the patterns. How to enumerate candidate patterns for evaluation without exponentially increasing the computation is another problem. In this paper, the modified periodicity transform is proposed to meet the requirements mentioned above. Also, a distributed computing framework is implemented to perform the mining task more efficiently. Both synthetic and biological sequences are utilized to examine the approach. The experimental results demonstrate the efficiency and effectiveness the system.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Priority refinement for dependent tasks in large embedded real-time software

Priority refinement for dependent tasks in large embedded re...

引用

IEEE Symposium on real-time and Embedded Technology and Applications

作者： J.R. Merrick S. Wang K.G. Shin Department of Electrical Engineering and Computer Science Real-Time Computing Laboratory The University of Michigan Ann Arbor MI

In a large embedded real-time system, priority assignment can greatly affect the timing behavior - which can consequently affect the overall behavior - of the system. Thus, it is crucial for model-based design of a large embedded real-time system to be able to intelligently assign priorities such that tasks can meet their deadlines. In this paper, we propose a priority-refinement method for dependent tasks distributed throughout a heterogeneous multiprocessor environment. In this method, we refine an initial priority assignment iteratively using the simulated annealing technique with tasks' latest completion times (LCT). Our evaluations, based on randomly-generated models, have shown that the refinement method outperforms other priority-assignment schemes and scales well for large, complex, real-time systems. This method has been implemented in the Automatic Integration of Reusable Embedded Software (AIRES) toolkit and has been successfully applied to a vehicle system control application.

关键词： Embedded software real time systems Timing Simulated annealing Vehicles Control systems Application software Programming Software architecture Embedded computing

来源：评论

学校读者我要写书评

暂无评论

Power-aware real-time scheduling using pinwheel model and profiling technique

Power-aware real-time scheduling using pinwheel model and pr...

引用

IEEE International Conference on Embedded and real-time computing Systems and Applications (RTCSA)

作者： Hsin-hung Lin Chih-Wen Hsueh Real-Time Systems Laboratory Department of Computer Science and Information Engineering National Chung Cheng University Chiayi Taiwan

关键词： Processor scheduling Power system modeling Dynamic voltage scaling Frequency Runtime Energy consumption Embedded system Batteries Energy management Control systems

来源：评论

学校读者我要写书评

暂无评论

Journal of information science and Engineering: Editorial notice

引用

Journal of information science and Engineering 2005年第5期21卷 i-ii页

作者： Lee, Der-Tsai Amato, Nancy M. Chang, Shih-Fu Chen, Homer H. Chen, Tsuhan Hsu, Tsan-Sheng Hwang, Jenq-Neng Kuo, Sy-Yen Kuo, Tei-Wei Li, Chung-Sheng Tokuyama, Takeshi Wing, Jeannette Wu, Tzong-Chen Yen, John Computer Science at Texas A and M University United States Parasol Laboratory United States IEEE Transactions on Parallel and Distributed Systems Computing Research Association's Committee on the Status of Women in Computing Research CRA-W's Distributed Mentor Program United States Department of Electrical Engineering Columbia University United States Lab. United States College of Electrical Engineering and Computer Science National Taiwan University Taiwan IEEE Transactions on Circuits and Systems for Video Technology IEEE Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA United States ACM ACM SIGACT IEEE Computer Society IICM Austria Research and Development of the Department Multimedia Signal Processing Technical Committee IEEE Signal Processing Society United States IEEE Transactions on Circuits and systems for Video Technology College of Electrical Engineering and Computer Science National Taiwan Ocean University Keelung Taiwan Department of Electrical Engineering National Taiwan University Taiwan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan IEEE Technical Committee on Real-Time Systems Computer Science Division IBM T.J. Watson Research Center United States IBM Research Division Graduate School of Information Sciences Tohoku University Japan ACM IPSJ Mathematical Society of Japan Japan Department of Computer Science Computer Science Department Carnegie Mellon University United States National Academies of Science's Computer Science and Telecommunications Board United States Microsoft's Trustworthy Academic Advisory Board Intel Research Pittsburgh's Advisory Board United States Dartmouth's Institute for Security Technology Studies Advisory Committee Canada Sloan Research Fellowships Program Committee United States ACM Taiwan China Information Sciences and Technology Pennsylvania State University United States Laboratory for Intelligent Agents Penn State's School of Info

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

LiSP: A Lightweight Security Protocol for Wireless Sensor Networks

引用

ACM Transactions on Embedded computing Systems 2004年第3期3卷 634-660页

作者： Park, Taejoon Shin, Kang G. Real-Time Computing Laboratory (RTCL) Department of Electrical Engineering and Computer Science The University of Michigan Ann Arbor MI 48109-2122 United States

Small low-cost sensor devices with limited resources are being used widely to build a self-organizing wireless network for various applications, such as situation monitoring and asset surveillance. Making such a sensor network secure is crucial to their intended applications, yet challenging due to the severe resource constraints in each sensor device. We present a lightweight security protocol (LiSP) that makes a tradeoff between security and resource consumption via efficient rekeying. The heart of the protocol is the novel rekeying mechanism that offers (1) efficient key broadcast without requiring retransmission/ACKs, (2) authentication for each key-disclosure without incurring additional overhead, (3) the ability of detecting/recovering lost keys, (4) seamless key refreshment without disrupting ongoing data encryption/decryption, and (5) robustness to inter-node clock skews. Furthermore, these benefits are preserved in conventional contention-based medium access control protocols that do not support reliable broadcast. Our performance evaluation shows that LiSP reduces resource consumption significantly, while requiring only three hash computations, on average, and a storage space for eight keys. © 2004, ACM. All rights reserved.

关键词： Authentication Design key management lightweight security Security sensor networks

来源：评论

学校读者我要写书评

暂无评论

Bonding plus: real-time message channel in linux ethernet environment using regular switching hub

Bonding plus: Real-time message channel in linux ethernet en...

引用

9th International Conference on real-time and Embedded computing Systems and Applications, RTCSA 2003

作者： Lin, Hsin-hung Hsueh, Chih-wen Huang, Guo-Chiuan Real-Time Systems Laboratory Department of Computer Science and Information Engineering National Chung Cheng University Chiayi621 Taiwan

ISBN: (纸本)9783540246862

Bandwidth management is very important to quality of service of network applications. Communications and data transmissions between hosts in a LAN environment may be large in many systems, such as clustering systems and parallel systems. If the network bandwidth is not enough, real-time packets may be delayed and miss their timing constraints. There are many technologies developed to increase host bandwidth in a LAN environment, but most of them need switching hubs with special support such as IEEE Link Aggregation Standard and are very expensive. In this paper, we propose a real-time message channel, BondingPlus, in Linux Ethernet environment which can make use of multiple Ethernet adapters simultaneously between hosts connected with regular switching hubs. When receiving packets from upper network layer, BondingPlus schedules packets in data link layer. real-time packets can be dispatched into a higher-priority queue so that the packets can be transmitted through the physical Ethernet interface right away. Furthermore, real-time applications can transmit real-time packets via one or several dedicated network adapters which create real-time message channels between hosts and thus reduce transmission delay and jitter dramatically, especially suitable for applications that have high bandwidth and real-time requirements. This approach is implemented in two Linux kernel modules and is backward compatible, flexible and transparent to users. BondingPlus pseudo Ethernet device driver module receives packets from upper network layer and dispatches the packets to multiple physical network adapters with a single IP address. ARP+ protocol module is responsible for maintaining a table of the mapping between an IP address and its corresponding MAC addresses of multiple physical network adapters. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Ethernet

来源：评论

学校读者我要写书评

暂无评论

On soft real-time guarantees on ethernet

On soft real-time guarantees on ethernet

引用

9th International Conference on real-time and Embedded computing Systems and Applications, RTCSA 2003

作者： Cho, Min-gyu Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science The University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)9783540246862

The medium access protocol of Ethernet, CSMA/CD, has an inherent limitation in providing real-time guarantees. Since Ethernet is the most commonly used local area network (LAN) technology due to its low cost, high bandwidth and robustness, it is very important to overcome this problem so that Ethernet can be used as a network for soft real-time applications like multimedia. An adaptive traffic smoother (ATS) was proposed as a kernel-level software solution that provides soft real-time guarantees on Ethernet. This paper addresses the reconfigurability, scalability and portability of ATS. First, a mechanism to read and adjust several user-specific parameters of ATS is discussed, and metrics or parameters to indicate the achievement of the user-required Quality-of-Service (QoS) are developed since these parameters are indirectly related to the user-specific QoS. Our experimental evaluation validates the feasibility of enhancing the reconfigurability and portability of ATS. Second, ATS is extended to a switched Ethernet which is commonly used for scalability. Our solution employs an ATS for each port of the switch for real-time packet delivery guarantees. Finally, a prototype of the user-level ATS is implemented and evaluated to enhance the portability of ATS. The performance of this user-level ATS is shown to be comparable to that of the kernel-level implementation, while enhancing both the reconfigurability and portability of real-time Ethernet solutions. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Ethernet

来源：评论

学校读者我要写书评

暂无评论

Coordinated aggregate scheduling for improving end-to-end delay performance

Coordinated aggregate scheduling for improving end-to-end de...

引用

International Workshop on Quality of Service

作者： W. Sun K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

This paper proposes a novel coordinated aggregate scheduling (CAS) algorithm that combines both EOF (earliest-deadline-first) scheduling and rate-based fair queueing. CAS uses guaranteed rate (GR) scheduling (Goyal, P et al., 1995) for traffic aggregates at the inter-aggregate level, but employs EDF-like scheduling at the intra-aggregate level. Computation of the deadline D/sub N/ of a packet at an intermediate node N is coordinated between the node N and its upstream nodes, and D/sub N/ is related to the packet's guaranteed rate clock (GRC) value at the flow-aggregation node. CAS provides tighter end-to-end (e2e) delay bounds than the "vanilla" GR aggregate scheduling that relies on FIFO queueing within an aggregate. Our in-depth simulation results demonstrate CAS's superior performance. Moreover, as an aggregate-based work-conserving scheduling algorithm, CAS incurs lower scheduling and state-maintenance overheads at routers than per-flow scheduling. These salient features make CAS very attractive for use in Internet core networks.

关键词： Aggregates Delay Scheduling algorithm Traffic control Processor scheduling Content addressable storage Telecommunication traffic Clocks IP networks Multiprotocol label switching

来源：评论

学校读者我要写书评

暂无评论

Component allocation with multiple resource constraints for large embedded real-time software design

Component allocation with multiple resource constraints for ...

引用

IEEE Symposium on real-time and Embedded Technology and Applications

作者： S. Wang J.R. Merrick K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

Allocating software components while meeting multiple platform resource constraints is crucial for model-based design of large embedded real-time software and automatic design model transformation. In this paper, we propose a new method for component allocation using an informed branch-and-bound and forward checking mechanism subject to a combination of resource constraints. We have implemented this method in the automatic integration of reusable embedded software (AIRES) toolkit - which has been developed under the DARPA MoBIES Program - and applied it to an automotive electronic throttle control (ETC) system. Our evaluation based on randomly-generated design models has shown that the proposed method scales well for large and complex embedded real-time software.

关键词： Resource management Software design Embedded software Control systems Embedded computing Forward contracts Automotive electronics Automatic control Software performance Scheduling

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：