Adaptive routing algorithms help balancing the resource utilization in different parts of the network and hence, prevent a resource becoming the performance bottleneck while other resources are still under-utilized. I...
详细信息
ISBN:
(纸本)9781467387767
Adaptive routing algorithms help balancing the resource utilization in different parts of the network and hence, prevent a resource becoming the performance bottleneck while other resources are still under-utilized. In this paper, we present a novel approach, called Preemptive Waiting, which is applied to Odd-Even routing algorithm (PWOE). PWOE postpones the saturation traffic rate of NoC by 13.4% compared to OE, under synthetic traffic loads.
the main objective of this paper is to present a real-time system to improve road safety through the use of event alerts. A collaborative community where users can share traffic warnings to help other users is here pr...
详细信息
ISBN:
(纸本)9781467387767
the main objective of this paper is to present a real-time system to improve road safety through the use of event alerts. A collaborative community where users can share traffic warnings to help other users is here proposed. the method is based both on the verification votes of the users, and on their profiles and trust levels. Each user is assigned a trust level depending on its previous behavior. the proposal is based on the assumption that the system will be run in every driver mobile device. thus, smartphones are the connectors between users and the community, using the cloud, and between the system and the users, using audio notifications.
this paper presents a framework to easily build and execute parallel applications in container-baseddistributed computing platforms in a user transparent way. the proposed framework is a combination of the COMP Super...
详细信息
ISBN:
(纸本)9781509060580
this paper presents a framework to easily build and execute parallel applications in container-baseddistributed computing platforms in a user transparent way. the proposed framework is a combination of the COMP Superscalar and Docker. We have built a prototype in order to evaluate how it performs by evaluating the overhead in the building, deployment and execution phases. We have observed an important gain compared with cloud environments during the building and deployment phases. In contrast, we have detected an extra overhead during the execution, which is mainly due to the multi-host Docker networking.
the Personal network (PN) concept extends the Personal Area network (PAN) by including remote personal nodes, such as nodes at home or in the office. this extension is achieved through dynamic tunnels established betw...
详细信息
ISBN:
(纸本)9780769530895
the Personal network (PN) concept extends the Personal Area network (PAN) by including remote personal nodes, such as nodes at home or in the office. this extension is achieved through dynamic tunnels established between the remote PN entities. Scalability presents a major challenge for tunnel management in PNs due to their dynamic nature and the increasing number of simultaneously supported PNs. To reduce the PN management complexity, this paper proposes to use a peer-to-peer-based publish/subscribe naming (PPNS) system. the PPNS system enables an automated provisioning of the location information in the tunnel endpoints. A centralised management approach is proposed for the on-demand PN establishment and a distributed management approach is proposed for the always-on PN establishment.
this paper presents a novel algorithm for distribution of user requests sent to a Web-server cluster driven by a Web switch. Our algorithm called FARD (Fuzzy Adaptive Request Distribution) is a client-and-server-aware...
详细信息
ISBN:
(纸本)0769518753
this paper presents a novel algorithm for distribution of user requests sent to a Web-server cluster driven by a Web switch. Our algorithm called FARD (Fuzzy Adaptive Request Distribution) is a client-and-server-aware, dynamic and adaptive dispatching policy. It assigns each incoming request to the server withthe least expected response time, estimated for that individual request. To estimate the expected response times FARD uses the fuzzy estimation mechanism. With respect to the requirement of modifiability of the model, FARD uses a neural network provided with innate abilities for learning and adaptation. We implemented a prototype FARD-based Web switch that was used in experiments carried out to compare its performance to well known representative request distribution algorithms. the measurements show that FARD benefits can be significant, especially for heterogeneous Web clusters.
Increasing memory parallelism in MPSoCs to provide higher memory bandwidth is achieved by accessing multiple memories simultaneously. Inasmuch as the response transactions of concurrent memory accesses must be in-orde...
详细信息
ISBN:
(纸本)9780769539393
Increasing memory parallelism in MPSoCs to provide higher memory bandwidth is achieved by accessing multiple memories simultaneously. Inasmuch as the response transactions of concurrent memory accesses must be in-order, a reordering mechanism is required. To our knowledge the resource utilization of conventional reordering mechanisms is low. In this paper, we present a novel network interface architecture for on-chip networks to increase the resource utilization and to improve overall performance. Also, based on the proposed architecture, a hybrid network interface is presented to integrate both memory and processor in a tile. the proposed architecture exploits AXI transaction based protocol to be compatible with existing IP cores. Experimental results with synthetic test cases demonstrate that the proposed architecture outperforms the conventional architecture in terms of latency. Also, the cost of the presented architecture is evaluated with UMC 0.09 mu m technology.
We report on the analysis of gen_server, a popular Erlang library to build client-server applications. Our analysis uses a tool based on choreographic models. We discuss how, once the library has been modelled in term...
详细信息
ISBN:
(纸本)9781467387767
We report on the analysis of gen_server, a popular Erlang library to build client-server applications. Our analysis uses a tool based on choreographic models. We discuss how, once the library has been modelled in terms of communicating finite state machines, an automated analysis can be used to detect potential communication errors. the results of our analysis suggest how to properly use gen_server in order to guarantee the absence of communication errors.
Traditional approaches for capacity planning are based on queueing network models. However, modeling with queueing networks requires the knowledge of the service demands of each class of workloads at each device descr...
详细信息
ISBN:
(纸本)9780769530895
Traditional approaches for capacity planning are based on queueing network models. However, modeling with queueing networks requires the knowledge of the service demands of each class of workloads at each device described in the model. In real systems, such service demands can be very difficult to measure. In this paper, we present an optimization-based technique to address the problem. the technique is formulated as a robust linear parameter estimation that can be used with both closed and open queueing network models. We consider the case where aggregate measurements (throughput and utilization) are available. Such measurements are typically much easier to obtain than the service demands. We present experimental results which prove the effectiveness of the constrained and robust linear estimation.
In consequence of an increasing demand for high-performance system, multiprocessor architectures became trend and used in a variety of fields (e.g. PC, laptops, mobile devices and so on). Multi-core processor can get ...
详细信息
ISBN:
(纸本)9781467387767
In consequence of an increasing demand for high-performance system, multiprocessor architectures became trend and used in a variety of fields (e.g. PC, laptops, mobile devices and so on). Multi-core processor can get outstanding throughput with relatively lower operating frequency and power consumption. In order to obtain the maximum throughput in a multi-core structure, it is necessary to schedule assigning tasks to multiple cores. In this paper, we propose a hardware scheduler that is tailored for multicore block cipher and verify the feasibility of the scheduler using AES algorithm.
We focus on agent-based simulations where a large number of agents move in the space, obeying to some simple rules. Since such kind of simulations are computational intensive, it is challenging, for such a contest, to...
详细信息
ISBN:
(纸本)9780769543284
We focus on agent-based simulations where a large number of agents move in the space, obeying to some simple rules. Since such kind of simulations are computational intensive, it is challenging, for such a contest, to let the number of agents to grow and to increase the quality of the simulation. A fascinating way to answer to this need is by exploiting parallel architectures. In this paper, we present a novel distributed load balancing schema for a parallel implementation of such simulations. the purpose of such schema is to achieve an high scalability. Our approach to load balancing is designed to be lightweight and totally distributed: the calculations for the balancing take place at each computational step, and influences the successive step. To the best of our knowledge, our approach is the first distributed load balancing schema in this context. We present boththe design and the implementation that allowed us to perform a number of experiments, with up-to 1, 000, 000 agents. Tests show that, in spite of the fact that the load balancing algorithm is local, the workload distribution is balanced while the communication overhead is negligible.
暂无评论