In this paper we describe a task allocation method, that utilizes genetic programming to find a suitable solution in an adequate time for this NP-complete combinatorial optimization problem. the underlying distributed...
详细信息
ISBN:
(纸本)9780769530499
In this paper we describe a task allocation method, that utilizes genetic programming to find a suitable solution in an adequate time for this NP-complete combinatorial optimization problem. the underlying distributed embedded system is heterogenous, consisting of different processors with different properties such as core type, clock frequency, available memory, and I/O interfaces, interconnected with different communication media. In our applications, which are described as data flow graphs, the number of tasks to be placed is much larger than the number of processors available. We highlight the difficulties when applying genetic programming to this problem and present our solutions and enhancements, accompanied with some simulation results.
Congestion control algorithms of existing reliable multicast protocols are mainly derived from end-to-end model, which has high resource requirements and sometimes suppresses the package sending too much. Many-to-many...
详细信息
ISBN:
(纸本)9780769536422
Congestion control algorithms of existing reliable multicast protocols are mainly derived from end-to-end model, which has high resource requirements and sometimes suppresses the package sending too much. Many-to-many reliable multicast requires efficient congestion control over a one-to-many model. It's an important mechanism to use many-to-many multicast in LAN (Local Area Network) in distributed simulation. In this paper, a congestion control algorithm based on loss trend for many-to-many reliable multicast is proposed. It predicts future package loss of receivers on the analysis of historic loss and buffer variety, and then control the congestion by adjusting the sending rate in advance. this algorithm aims at the reliable multicast in LAN. the main idea of the algorithm is to lower the possibility of multicast package loss, and then the nodes can afford the cost of package recovery. It alleviates the congestion on the depression of package loss possibility by regulating the sending rate. Experiment results indicate that the algorithm can keep a high throughput of many-to-many reliable multicast with relatively real-time performance.
this paper describes a new prolocol for authentication in Peer-to-Peer systems. the protocol has been designed to meet specialized requirements of P2P systems, such as lack of direct communication between peers or req...
详细信息
ISBN:
(纸本)0769524052
this paper describes a new prolocol for authentication in Peer-to-Peer systems. the protocol has been designed to meet specialized requirements of P2P systems, such as lack of direct communication between peers or requirements for controlled anonymity. At the same time, a P2P authentication protocol must be resistant to spoofing, eavesdropping and playback, and man-in-the-middle attacks. the protocol is studied for a model P2P storage system that needs to implement file access rights.
Withthe steady increase of offered cloud storage services, they became a popular alternative to local storage systems. Beside several benefits, the usage of cloud storage services can offer, they have also some downs...
详细信息
ISBN:
(纸本)9781538613269
Withthe steady increase of offered cloud storage services, they became a popular alternative to local storage systems. Beside several benefits, the usage of cloud storage services can offer, they have also some downsides like potential vendor lock-in or unavailability. Different pricing models, storage technologies and changing storage requirements are further complicating the selection of the best fitting storage solution. In this work, we present a heuristic optimization approach that optimizes the placement of data on cloud-based storage services in a redundant, cost- and latency-efficient way while considering user-defined Quality of Service requirements. the presented approach uses monitored data access patterns to find the best fitting storage solution. through extensive evaluations, we show that our approach saves up to 30% of the storage cost and reduces the upload and download times by up to 48% and 69% in comparison to a baseline that follows a state-of-the-art approach.
Data can be store as structured, semi-structured or unstructured formats in various distributed environments. Extraction of data from multiple data sources or data warehouse and convert to a proper order is quite time...
详细信息
the previous works in the area of checking integrity constraints in distributed databases have suggested that sufficient tests should be explored as these tests are cheaper than the complete tests and the initial cons...
详细信息
ISBN:
(纸本)9780769530499
the previous works in the area of checking integrity constraints in distributed databases have suggested that sufficient tests should be explored as these tests are cheaper than the complete tests and the initial constraints due to their characteristics which can be executed at the local (target) site. this paper presents the various types of integrity tests as reported in previous works and discusses how these tests can significantly improve the performance of the constraint checking mechanisms with respect to the amount of data transferred across the network, without limiting to certain type of test as suggested by previous researchers in this area.
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. parallelapplications are often expressed using a task-parall...
详细信息
Gigabit network technologies have made it possible to combine workstations into a distributed, massively-parallel computer system. Middleware, such as distributed shared objects (DSO), attempts to improve programmabil...
详细信息
ISBN:
(纸本)0818678135
Gigabit network technologies have made it possible to combine workstations into a distributed, massively-parallel computer system. Middleware, such as distributed shared objects (DSO), attempts to improve programmability of such systems, by providing globally accessible 'object' abstractions, Researchers have developed consistency protocols for replicated 'memory' objects. these protocols are well suited to scientific applications but less suited to multimedia or groupware applications. this paper addresses the state sharing needs of complex distributedapplications with (1) high-frequency symmetric accesses to shared objects, (2) unpredictable and limited locality of accesses, (3) dynamically changing sharing behavior, and (4) potential data races. We show that a DSO system exploiting application-level temporal and spatial constraints an shared objects can outperform shared object protocols which do not exploit application-level constraints. We compare our S(emantic) DSO against entry consistency using a sample application having the four properties mentioned above.
As one of the killing applications in NGI, peer-to-peer networks (P2P for short) have rapidly developed in recent years. We survey and catalog the current hot research aspects in P2P networks, compare and review most ...
详细信息
ISBN:
(纸本)9780769527369
As one of the killing applications in NGI, peer-to-peer networks (P2P for short) have rapidly developed in recent years. We survey and catalog the current hot research aspects in P2P networks, compare and review most of the research work in P2P networks, and summarize the research means and their problems.
Using effective scheduling strategies to improve turnaround time, slowdown, and utilization is an important consideration in large supercomputing environments. Since such machines have traditionally used non-preemptio...
详细信息
暂无评论