Despite rapid growth in workstation and networking technologies, the workstation environment continues to pose challenging problems to shared processing. In this paper, we present a computational model and system for ...
详细信息
Despite rapid growth in workstation and networking technologies, the workstation environment continues to pose challenging problems to shared processing. In this paper, we present a computational model and system for the generation of distributed applications in such an environment. The well-known RPC model is modified by a novel concept known as template attachment. A computation consists of a network of sequential procedures which have been encapsulated in templates. A small selection of templates is available from which a distributed application with the desired communication behavior can be rapidly built. The system generates all the required low-level code for correct synchronization, communication, and scheduling. This results in a system that is easy to use and flexible, and can provide a programmer with the desired amount of control in using idle processing power over a network of workstations. The practical feasibility of the model has been demonstrated by implementing it for Unix1-based workstation environments.
Machine learning time series models have been used to predict COVID-19 pandemic infections. Based on the public dataset from Johns Hopkins, we present a novel framework for forecasting COVID-19 infections. We implemen...
详细信息
Overlapping Reconfiguration is currently the most effi-cient method to reconfigure an interconnection network, but is only valid for systems that apply distributed routing. This paper proposes a solution which enables...
详细信息
Efficient scheduling is a key concern for the effectual execution of performance driven Grid applications, such as workflows. Many list heuristics have been developed for scheduling workflows in centralized Grid envir...
详细信息
In this paper, we propose a taxonomy that characterizes and classifies different components of autonomic application management in Grids. We also survey several representative Grid systems developed by various project...
详细信息
In this paper, a reputation-based Grid workflow scheduling algorithm is proposed to counter the effect of inherent unreliability and temporal characteristics of computing resources in large scale, decentralized Grid o...
详细信息
作者:
Ismail, LeilaMaterwala, HunedUnited Arab Emirates University
College of Information Technology Distributed Computing and Systems Research Laboratory Department of Computer Science and Software Engineering Abu-Dhabi Al-Ain15551 United Arab Emirates
Diabetes is one of the top 10 causes of death worldwide. Health professionals are aiming for machine learning models to support the prognosis of diabetes for better healthcare and to put in place an effective preventi...
详细信息
In this paper, we analyze notarial requirements in the electronic commerce based on the Internet and design the notarial system to support secure transactions, which provides the notarial service for assurance of tran...
详细信息
ISBN:
(纸本)0818672250
In this paper, we analyze notarial requirements in the electronic commerce based on the Internet and design the notarial system to support secure transactions, which provides the notarial service for assurance of transactions between customer and merchant running shopping mall connected to the Internet. We suggest that electronic commerce should offer not only authentication service but also notarial service in order to provide secure transactions over the Internet.
In packet-switched networks, queueing of packets at the switches can result when multiple connections share the same physical link. To accommodate a large number of connections, a switch can employ link-scheduling alg...
详细信息
ISBN:
(纸本)0818680164
In packet-switched networks, queueing of packets at the switches can result when multiple connections share the same physical link. To accommodate a large number of connections, a switch can employ link-scheduling algorithms to prioritize the transmission of the queued packets. Due to the high-speed links and small packet sizes, a hardware solution is needed for the priority queue in order to make the link schedulers effective. But for good performance, the switch should also support a large number of priority levels (P) and be able to buffer a large number of packets (N). So a hardware priority queue design must be both fast and scalable (with respect to N and P) in order to be implemented effectively. In this paper, we first compare four existing hardware priority queue architectures, and identify scalability limitations on implementing these existing architectures for large N and P. Based on our findings, we propose two new priority queue architectures, and evaluate them using simulation results from Verilog HDL and Epoch implementations.
暂无评论