2008 International Conference on Parallel Processing - Workshops最新文献

筛选

英文中文

Non-Contiguous I/O Support for Object-Based Storage 对象存储的非连续I/O支持

2008 International Conference on Parallel Processing - Workshops Pub Date : 2008-09-08 DOI: 10.1109/ICPP-W.2008.23

D. Dalessandro, A. Devulapalli, P. Wyckoff

{"title":"Non-Contiguous I/O Support for Object-Based Storage","authors":"D. Dalessandro, A. Devulapalli, P. Wyckoff","doi":"10.1109/ICPP-W.2008.23","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.23","url":null,"abstract":"The access patterns performed by disk-intensive applications vary widely, from simple contiguous reads or writes through an entire file to completely unpredictable random access. Often, applications will be able to access multiple disconnected sections of a file in a single operation. Application programming interfaces such as POSIX and MPI encourage the use of non-contiguous access with calls that process I/O vectors. Under the level of the programming interface, most storage protocols do not implement I/O vector operations (also known as scatter/gather). These protocols, including NFSv3 and block-based SCSI devices, must instead issue multiple independent operations to complete the single I/O vector operation specified by the application, at a cost of a much slower overall transfer time. Scatter/gather I/O is critical to the performance of many parallel applications, hence protocols designed for this area do tend to support I/O vectors. Parallel Virtual File System (PVFS) in particular does so; however, a recent specification for object-based storage devices (OSD) does not. Using a software implementation of an OSD as storage devices in a Parallel Virtual File System (PVFS) framework, we show the advantages of providing direct support for non-contiguous data transfers. We also implement the feature in OSDs in a way that is both efficient for performance and appropriate for inclusion in future specification documents.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129172153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Replay-Based Synchronization of Timestamps in Event Traces of Massively Parallel Applications 大规模并行应用程序事件轨迹中基于重播的时间戳同步

2008 International Conference on Parallel Processing - Workshops Pub Date : 2001-01-03 DOI: 10.1109/ICPP-W.2008.17

Daniel Becker, J. C. Linford, R. Rabenseifner, F. Wolf

{"title":"Replay-Based Synchronization of Timestamps in Event Traces of Massively Parallel Applications","authors":"Daniel Becker, J. C. Linford, R. Rabenseifner, F. Wolf","doi":"10.1109/ICPP-W.2008.17","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.17","url":null,"abstract":"Event traces are helpful in understanding the performance behavior of message-passing applications since they allow in-depth analyses of communication and synchronization patterns. However, the absence of synchronized hardware clocks may render the analysis ineffective because inaccurate relative event timings can misrepresent the logical event order and lead to errors when quantifying the impact of certain behaviors. Although linear offset interpolation can restore consistency to some degree, inaccuracies and time-dependent drifts may still disarrange the original succession of events - especially during longer runs. In our earlier work, we have presented an algorithm that removes the remaining violations of the logical event order postmortem and, in addition, have outlined the initial design of a parallel version. Here, we complete the parallel design and describe its implementation within the SCALASCA trace-analysis framework. We demonstrate its suitability for large-scale applications running on more than a thousand application processes and show how the correction can improve the trace analysis of a real-world application example.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"432 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122468751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

首页上一页