Synchronized Disk Interleaving
IEEE Transactions on Computers
Memory requirements for balanced computer architectures
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Multi-disk management algorithms
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
Distributing resources in hypercube computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Performance of the Direct Binary n-Cube Network for Multiprocessors
IEEE Transactions on Computers
An Evaluation of Multiple-Disk I/O Systems
IEEE Transactions on Computers
Organizing matrices and matrix operations for paged memory systems
Communications of the ACM
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Evaluation of Logical External Memory Architectures for MultiprocessorSystems
Evaluation of Logical External Memory Architectures for MultiprocessorSystems
Performance measurement of a parallel Input/Output system for the Intel iPSC/2 Hypercube
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Asynchronous Disk Interleaving: Approximating Access Delays
IEEE Transactions on Computers
Comparison of hypercube, hypernet, and symmetric hypernet architectures
ACM SIGARCH Computer Architecture News
Performance evaluation of a massively parallel I/O subsystem
ACM SIGARCH Computer Architecture News - Special issue on input/output in parallel computer systems
Performance evaluation of a parallel I/O architecture
ICS '95 Proceedings of the 9th international conference on Supercomputing
A study of I/O behavior of perfect benchmarks on a multiprocessor
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems
IEEE Transactions on Parallel and Distributed Systems
I/O Placement Strategies and their Data Locality Sensitivities in kxk Toroidal Networks
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Resource Placements in 2D Tori
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Performance evaluation of memory systems
Journal of Computing Sciences in Colleges
On resource placements in 3D tori
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Perfect Distance-d Placements in 2D Toroidal Networks
The Journal of Supercomputing
Quasi-perfect resource placements for two-dimensional toroidal networks
Journal of Parallel and Distributed Computing
Chromatic sets of power graphs and their application to resource placement in multicomputer networks
Computers & Mathematics with Applications
Resource placement in Cartesian product of networks
Journal of Parallel and Distributed Computing
Allocation strategies of multimedia data on disk arrays
Computer Communications
Resource placement in networks using chromatic sets of power graphs
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
Several issues concerning the design of an I/O (input/output) system for a multiprocessor such as a hypercube are examined. A methodology is proposed for connecting the I/O processors to such a system for efficient I/O access. The effect of I/O communication onthe multiprocessor network is analyzed. Different disk organizations that can be employed within such a system are evaluated to see which organization has a better performance. It is observed that parallelism in serving an I/O request plays a dominant role in the scientific workload. The problem of mapping specific data structures such as matrices onto the disks so that the data can be accessed efficiently is considered.