There exists several FPGA architectures that can be partially reconfigured at run-time. The advantage of partial run-time reconfiguration is that it allows to develop new algorithmic solutions for many applications. B...
详细信息
ISBN:
(纸本)9781424419920
There exists several FPGA architectures that can be partially reconfigured at run-time. The advantage of partial run-time reconfiguration is that it allows to develop new algorithmic solutions for many applications. But a limiting factor for using frequent dynamic reconfiguration could be the reconfiguration overhead. In order to study the potential of frequent run-time reconfiguration it is interesting to investigate its costs and benefits from an abstract point of view and to develop new architectural concepts. In this paper, we provide a formal treatment of the reconfiguration costs and compare them for models of standard partially reconfigurable FPGAs and 2-level reconfigurable FPGAs.
The upcoming reconfigurable video coding (RVC) standard from MPEG (ISO/IEC SC29WG11) defines a library of coding tools to specify existing or new compressed video formats and decoders. The coding tool library has been...
详细信息
The upcoming reconfigurable video coding (RVC) standard from MPEG (ISO/IEC SC29WG11) defines a library of coding tools to specify existing or new compressed video formats and decoders. The coding tool library has been written in a dataflow/actor-oriented language named CAL. Each coding tool can be represented with an extended finite state machine and the dependencies between the tools are described as dataflow graphs. This paper proposes an approach to derive a multiprocessor execution schedule for RVC systems that are comprised of CAL actors. In addition to proposing a scheduling approach for RVC, an extension to the well-known permutation flow shop scheduling problem that enables rapid run-time scheduling of RVC tasks is introduced.
We propose an algorithm that is based on the Ant Colony Optimization (ACO) metaheuristic for producing harmonized melodies. The algorithm works in two stages. In the first stage it creates a melody. This melody is the...
详细信息
We propose an algorithm that is based on the Ant Colony Optimization (ACO) metaheuristic for producing harmonized melodies. The algorithm works in two stages. In the first stage it creates a melody. This melody is then harmonized according to the rules of Baroque harmony in the second stage. This is the first ACO algorithm to create music that uses domain knowledge and the first employed for harmonization of a melody.
In today's world of pervasive computing, the mobile devices are enriched with a variety of features and being used as a personal information delivery platform. The increased processing, storage and communication c...
详细信息
In today's world of pervasive computing, the mobile devices are enriched with a variety of features and being used as a personal information delivery platform. The increased processing, storage and communication capabilities of these devices combined with the latest developments in the area of service oriented architecture enables a new class of services, called nomadic mobile services (NMS). Recent research has resulted in different NMS provisioning approaches; each one employs/defines a different architecture and addresses a different mix of issues. This paper provides a comparative study of three NMS provisioning approaches based on their architectural design, development choices and prototyped applications. Each approach has its own merits considering the applications they aim at. However, in the future, a solution which uses Web services for better interoperability and employs proxy approach for better QoS could be a possible technical design.
Now that the Internet and Web are abundantly present in every days live and net-working and computing speed are improving at an impressive rate, more and more attempts become visible to apply these developments toward...
详细信息
New Particle Swarm Optimization (PSO) methods for dynamic and noisy function optimization are studied in this paper. The new methods are based on the hierarchical PSO (H-PSO) and a new type of H-PSO algorithm, called ...
详细信息
A self-organized allocation scheme for service tasks in computing systems is proposed in this paper. Usually components of a computing system need some service from time to time in order perform their work efficiently...
详细信息
Several routing protocols for IEEE 802.11 mesh networks that operate at multiple RF channels have been described before [1][2][3]. However, only few facts about link-level characteristics in multi-channel environments...
详细信息
ISBN:
(纸本)1595933069
Several routing protocols for IEEE 802.11 mesh networks that operate at multiple RF channels have been described before [1][2][3]. However, only few facts about link-level characteristics in multi-channel environments have been published. This paper presents observations, made in an indoor testbed, about the impact of channel-assignment on the quality of links. We argue that the assumption 'all radio channels are equal' does not hold in almost all indoor scenarios. Hence, great care must be taken when assigning radio channels to individual links, in order not to spoil network performance. We found that for any given environment the quality and symmetry of a wireless link (quantified by delivery probability) varies significantly depending on the radio channel used. The delivery probability between the best and the worst case could easily exceed a factor of two. However, existing IEEE 802.11 multi-channel protocols assume that all channels are equal, which does not reflect real-world conditions. To remedy to this shortcoming we present the Multi Channel Extremely Opportunistic Routing MCExOR protocol [3]. Copyright 2006 ACM.
Web Service technologies offer a successful way for interoperability among applications. However, although current approaches are beginning to address how to specify non-functional capabilities in Web Services at desc...
详细信息
暂无评论