Optimized scatter/gather data operations for parallel storage

Author(s):  
Latchesar Ionkov ◽  
Carlos Maltzahn ◽  
Michael Lang
Keyword(s):  
2015 ◽  
Vol 785 ◽  
pp. 236-240
Author(s):  
Tan Jen Hau ◽  
N.M. Nor ◽  
T. Ibrahim ◽  
H. Daud

A new method for monitoring and control of domestic distribution box is proposed and developed for automated recovery of power continuity during interruption. The system automatically test each of the sockets to determine the source of the failure and isolate them. The data of the modified connection will be sent to the client through a server, wirelessly to notify the user the modifications made. Parallel processing via multi-threading in the server are used to increment the upper limit of TCP transmission's throughput. Multiple SQLite database are used by multiple threads for parallel storage of data to increase performance.


Author(s):  
Matthew L. Curry ◽  
H. Lee Ward ◽  
Geoff Danielson ◽  
Jay Lofstead

Author(s):  
Esma Yildirim ◽  
Tevfik Kosar

The emerging petascale increase in the data produced by large-scale scientific applications necessitates innovative solutions for efficient transfer of data through the advanced infrastructure provided by today’s high-speed networks and complex computer-architectures (e.g. supercomputers, parallel storage systems). Although the current optical networking technology reached transport speeds of 100Gbps, the applications still suffer from the inadequate transport protocols and end-system bottlenecks such as processor speed, disk I/O speed and network interface card limits that cause underutilization of the existing network infrastructure and let the application achieve only a small portion of the theoretical performance. Fortunately, with the parallelism provided by usage of multiple CPUs/nodes and multiple disks present in today’s systems, these bottlenecks could be eliminated. However it is necessary to understand the characteristics of the end-systems and the transport protocol used. In this book chapter, we analyze methodologies that will improve the data transfer speed of applications and provide maximal speeds that could be obtained from the available end-system resources and high-speed networks through usage of end-to-end dataflow parallelism.


2011 ◽  
pp. 233-245
Author(s):  
Constantinos Mourlas

One way to implement adaptive software is to allocate resources dynamically during run-time rather than statically at design time. Design of adaptive software and adaptive execution of processes are key factors that improve versatility of software and decrease maintenance costs. In this chapter we study the development of adaptive software focusing on a design strategy for the implementation of parallel media servers with an adaptable behaviour. This strategy makes the timing properties and the quality of presentation of a set of media streams predictable. The proposed adaptive scheduling approach exploits the performance of parallel environments and seems a promising method that brings the advantages of parallel computation in media servers. The proposed mechanism provides deterministic service for both Constant Bit Rate (CBR) and Variable Bit Rate (VBR) streams. We present an efficient placement strategy for data frames as well as an adaptability strategy that allows appropriate frames to be dropped without sacrificing the ability to present multimedia applications predictably in time.


Sign in / Sign up

Export Citation Format

Share Document