Yuri Nishikawa, M. Koibuchi, Hiroki Matsutani, H. Amano
System area networks (SANs), which usually employ virtual cut-through switching, have been used to connect hosts in modern PC clusters and massively parallel computers. In this paper, we propose a non-minimal fully adaptive deadlock-free routing mechanism for virtual-cut-through networks called “Semi-deflection”. Semi-deflection routing guarantees deadlock-free packet transfer without use of virtual channels by allowing non-blocking transfer between specific pairs of routers. As the result of throughput evaluation, Semideflection routing improved throughput by up to 26 percent compared with that of north-last turn model, which is a typical adaptive routing, and also reduced latency.
{"title":"A Deadlock-Free Non-minimal Fully Adaptive Routing Using Virtual Cut-Through Switching","authors":"Yuri Nishikawa, M. Koibuchi, Hiroki Matsutani, H. Amano","doi":"10.1109/NAS.2010.50","DOIUrl":"https://doi.org/10.1109/NAS.2010.50","url":null,"abstract":"System area networks (SANs), which usually employ virtual cut-through switching, have been used to connect hosts in modern PC clusters and massively parallel computers. In this paper, we propose a non-minimal fully adaptive deadlock-free routing mechanism for virtual-cut-through networks called “Semi-deflection”. Semi-deflection routing guarantees deadlock-free packet transfer without use of virtual channels by allowing non-blocking transfer between specific pairs of routers. As the result of throughput evaluation, Semideflection routing improved throughput by up to 26 percent compared with that of north-last turn model, which is a typical adaptive routing, and also reduced latency.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125810722","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}
Many professional cluster systems consist of nodes with different hardware configurations. Such heterogeneous environments require different load-balancing techniques than homogenous environments. The c-load-collision-protocol is able to achieve good results for data-management purposes. Using this protocol, we propose a way for load-balancing in interactive rendering environments. For this work, we implemented a parallel rendering system and took different picking strategies into account to compare the results. The advantage of our approach compared to other approaches is that we group the available nodes of a cluster into two different categories, based on the hardware abilities. Some nodes are used solely for rendering, while others serve as secondary storage and to assist the former ones by performing auxiliary calculations.
{"title":"Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments","authors":"Tim Süß, T. Wiesemann, M. Fischer","doi":"10.1109/NAS.2010.52","DOIUrl":"https://doi.org/10.1109/NAS.2010.52","url":null,"abstract":"Many professional cluster systems consist of nodes with different hardware configurations. Such heterogeneous environments require different load-balancing techniques than homogenous environments. The c-load-collision-protocol is able to achieve good results for data-management purposes. Using this protocol, we propose a way for load-balancing in interactive rendering environments. For this work, we implemented a parallel rendering system and took different picking strategies into account to compare the results. The advantage of our approach compared to other approaches is that we group the available nodes of a cluster into two different categories, based on the hardware abilities. Some nodes are used solely for rendering, while others serve as secondary storage and to assist the former ones by performing auxiliary calculations.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127154096","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}
Correct and effective instruction pre-fetch strategy is key technique to avoid instruction misses. Unfortunately, branch direction correctness and the accuracy of instruction pre-fetch is not very good, and the utilization ratio of memory bandwidth is relative low, all of these mentioned reasons are the main factors leading to instruction miss. This paper proposes an adaptive and selective instruction active push mechanism for multi-core architecture, called ASIAP. On one hand, request number of invalid instruction pre-fetch is decreased and precise instruction pre-fetch is carried on; on the other hand, part of non-sequential type requests are responded preferentially by a specific instruction active push unit adaptively and selectively. Simulation result indicates that, in double-core configuration, relative to three other strategies, Next_Line, Target_Line and Wrong_Path, the accuracy of ASIAP improves average 22.59%, 11.84% and 8.85% respectively. Relative to Next_Line, the reduction of L1 I-Cache miss ranges from 17.7% to 33.5%, average 26.08%.
{"title":"An Adaptive and Selective Instruction Active Push Mechanism for Multi-core Architecture","authors":"Jun Zhang, K. Mei, Jizhong Zhao","doi":"10.1109/NAS.2010.15","DOIUrl":"https://doi.org/10.1109/NAS.2010.15","url":null,"abstract":"Correct and effective instruction pre-fetch strategy is key technique to avoid instruction misses. Unfortunately, branch direction correctness and the accuracy of instruction pre-fetch is not very good, and the utilization ratio of memory bandwidth is relative low, all of these mentioned reasons are the main factors leading to instruction miss. This paper proposes an adaptive and selective instruction active push mechanism for multi-core architecture, called ASIAP. On one hand, request number of invalid instruction pre-fetch is decreased and precise instruction pre-fetch is carried on; on the other hand, part of non-sequential type requests are responded preferentially by a specific instruction active push unit adaptively and selectively. Simulation result indicates that, in double-core configuration, relative to three other strategies, Next_Line, Target_Line and Wrong_Path, the accuracy of ASIAP improves average 22.59%, 11.84% and 8.85% respectively. Relative to Next_Line, the reduction of L1 I-Cache miss ranges from 17.7% to 33.5%, average 26.08%.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128457481","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}
On-demand routing protocols used in mobile ad hoc networks suffer from transmitting a huge number of control packets which increases the overhead. In this new algorithm (ERDA), we try to improve the route discovery algorithm by reducing the routing overhead in the presence of random traffic. ERDA broadcasts any route request travelling within their source node’s neighbourhood region according to the routing algorithm used. However, propagation of the route request is deliberately delayed outside this region to provide the associated chase packet with an opportunity to stop the fulfilled route request and minimise network congestion. The algorithm is adaptive and continuously updates the boundary of each source node’s neighbourhood to improve performance. We provide detailed performance evaluation using simulation modelling. Our result shows that ERDA improves the performance by minimizing the average end-to-end delay as well as the network overhead and congestion level.
{"title":"Efficient Route Discovery Algorithm for MANETs","authors":"Mznah Al-Rodhaan, A. Al-Dhelaan","doi":"10.1109/NAS.2010.30","DOIUrl":"https://doi.org/10.1109/NAS.2010.30","url":null,"abstract":"On-demand routing protocols used in mobile ad hoc networks suffer from transmitting a huge number of control packets which increases the overhead. In this new algorithm (ERDA), we try to improve the route discovery algorithm by reducing the routing overhead in the presence of random traffic. ERDA broadcasts any route request travelling within their source node’s neighbourhood region according to the routing algorithm used. However, propagation of the route request is deliberately delayed outside this region to provide the associated chase packet with an opportunity to stop the fulfilled route request and minimise network congestion. The algorithm is adaptive and continuously updates the boundary of each source node’s neighbourhood to improve performance. We provide detailed performance evaluation using simulation modelling. Our result shows that ERDA improves the performance by minimizing the average end-to-end delay as well as the network overhead and congestion level.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132670328","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}
The previous study of pattern discovery in storage systems focus on sequential pattern (SP) mining in lower level traces, but they don’t scale well to the application level. For patterns in application level are mostly composed of Contiguous Item Sequential Patterns (CISP) which are much simpler than SP, so it’s inefficient for the previous studies to mine CISP with clumsy SP mining algorithms. We propose a novel algorithm FPG-Grow which is more preferable for mining application level IO patterns. The FPG-Grow only scan the origin sequence in one-pass to construct a Frequent Pattern Graph (FPG), from which we can easily extract the CISPs by fetching the frequent sub-graphs with linear cost. Also we can do the verification efficiently by avoiding the origin sequence scan. Furthermore, the grow method will eliminate the information loss introduced by sequence cutting as C-Miner does. The experiment result shows that the FPG-Grow outperforms C-Miner prominently in mining with real application IO traces and the simulation result also proves the effectiveness of CISP in application IO optimizations.
{"title":"FPG-Grow: A Graph Based Pattern Grow Algorithm for Application Level IO Pattern Mining","authors":"Jingliang Zhang, Junwei Zhang, Lu Xu","doi":"10.1109/NAS.2010.23","DOIUrl":"https://doi.org/10.1109/NAS.2010.23","url":null,"abstract":"The previous study of pattern discovery in storage systems focus on sequential pattern (SP) mining in lower level traces, but they don’t scale well to the application level. For patterns in application level are mostly composed of Contiguous Item Sequential Patterns (CISP) which are much simpler than SP, so it’s inefficient for the previous studies to mine CISP with clumsy SP mining algorithms. We propose a novel algorithm FPG-Grow which is more preferable for mining application level IO patterns. The FPG-Grow only scan the origin sequence in one-pass to construct a Frequent Pattern Graph (FPG), from which we can easily extract the CISPs by fetching the frequent sub-graphs with linear cost. Also we can do the verification efficiently by avoiding the origin sequence scan. Furthermore, the grow method will eliminate the information loss introduced by sequence cutting as C-Miner does. The experiment result shows that the FPG-Grow outperforms C-Miner prominently in mining with real application IO traces and the simulation result also proves the effectiveness of CISP in application IO optimizations.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124654845","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}
In this work, we focus on the problem of fault tolerant data collection in heterogeneous Intelligent Monitoring Networks(IMNs). IMNs are expected to have a wide range of applications in many fields such as forest monitoring, structural monitoring, and industrial plant monitoring. We present our fault tolerant datacollection scheme in the hierarchical structure of IMNs. We use an interesting technique borrowed from the popular BitTorrent software to maintain a highly efficient and robust data collection in IMNs with heterogeneous and faulty devices. In our proposed scheme, monitoring sensors are instructed to randomly select some overheard transmissions and process them in data fusion. Our preliminary study confirmed the benefits of the fault tolerant data collection strategy.
{"title":"Fault Tolerant Data Collection in Heterogeneous Intelligent Monitoring Networks","authors":"Jing Deng, Meikang Qiu, Gang Wu","doi":"10.1109/NAS.2010.21","DOIUrl":"https://doi.org/10.1109/NAS.2010.21","url":null,"abstract":"In this work, we focus on the problem of fault tolerant data collection in heterogeneous Intelligent Monitoring Networks(IMNs). IMNs are expected to have a wide range of applications in many fields such as forest monitoring, structural monitoring, and industrial plant monitoring. We present our fault tolerant datacollection scheme in the hierarchical structure of IMNs. We use an interesting technique borrowed from the popular BitTorrent software to maintain a highly efficient and robust data collection in IMNs with heterogeneous and faulty devices. In our proposed scheme, monitoring sensors are instructed to randomly select some overheard transmissions and process them in data fusion. Our preliminary study confirmed the benefits of the fault tolerant data collection strategy.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126674319","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}
Flash SSDs are being incorporated in many enterprise storage platforms recently. However, the characteristics of the flash SSD are quite different from that of hard disk. The IO strategies in the existing systems should be carefully evaluated. This paper provides an evaluation on the flash-based transaction processing system. Two file systems, traditional in-place update-based file system and log-structured file system, are selected as the representative of two write strategies. Usually, the log-structured file system is believed to play better on flash SSDs. Our experiment shows that the performance results of two database applications are diverse with two file systems on different flash SSDs. We analyze the performance in different configurations. Based on the analysis, we provide our experience on building the flash-based database system to better utilize the performance benefits of flash SSDs.
{"title":"Early Experience and Evaluation of File Systems on SSD with Database Applications","authors":"Yongkun Wang, K. Goda, M. Nakano, M. Kitsuregawa","doi":"10.1109/NAS.2010.12","DOIUrl":"https://doi.org/10.1109/NAS.2010.12","url":null,"abstract":"Flash SSDs are being incorporated in many enterprise storage platforms recently. However, the characteristics of the flash SSD are quite different from that of hard disk. The IO strategies in the existing systems should be carefully evaluated. This paper provides an evaluation on the flash-based transaction processing system. Two file systems, traditional in-place update-based file system and log-structured file system, are selected as the representative of two write strategies. Usually, the log-structured file system is believed to play better on flash SSDs. Our experiment shows that the performance results of two database applications are diverse with two file systems on different flash SSDs. We analyze the performance in different configurations. Based on the analysis, we provide our experience on building the flash-based database system to better utilize the performance benefits of flash SSDs.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125968059","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}
Block-level continuous data protection (CDP) logs every disk write operation so that the disk can be rolled back to any arbitrary point-in-time within a time window. For each update operation is time stamped and logged, the indexing for such huge amounts of records is an important and challenging problem. Unfortunately, the conventional indexing methods can not efficiently record large numbers of versions and support instant “time-travel” types of queries in CDP. In this paper, we present an effective indexing method providing timely recovery to any point-in-time in comprehensive versioning systems, called the Hierarchical Spatial-Temporal Indexing Method (HSTIM). The basic principle of HSTIM is to partition the time domain and the production storage LBAs into time slice and segments respectively according to update frequency of disk IOs, and build separate index file for each segment. In order to meet the demands of instant view of history data, the metadata of production storage is independently indexed. For long-time history data retrieval requirements, index snapshot is introduced in HSTIM to reduce the retrieval time. Another distinctive feature of HSTIM is its incremental retrieval method, which achieves high query performance at time point t + t if neighboring time point t is queried previously. The paper compares HSTIM with traditional B+-tree and multi-version B-tree (MVBT) index in many aspects. Experiments with real workload IO trace files show that HSTIM can locate history data within 8.05 seconds for recovery point of 48 hours, while B+-tree consumes 24.04 seconds. If the index snapshot is applied, HSTIM can reduce such retrieval time within 3 seconds.
CDP (Block-level continuous data protection)记录磁盘的每次写操作，以便在一个时间窗口内将磁盘回滚到任意时间点。由于每个更新操作都有时间戳和日志，因此对如此大量的记录进行索引是一个重要且具有挑战性的问题。遗憾的是，传统的索引方法不能有效地记录大量的版本，也不能支持CDP中即时的“时间旅行”类型的查询。在本文中，我们提出了一种有效的索引方法，可以在综合版本控制系统中及时恢复到任何时间点，称为分层时空索引方法(HSTIM)。HSTIM的基本原理是根据磁盘io的更新频率，将时域和生产存储LBAs分别划分为时间片和时间段，并为每个时间段构建单独的索引文件。为了满足即时查看历史数据的需求，生产存储的元数据被独立索引。针对长时间的历史数据检索需求，在HSTIM中引入了索引快照来减少检索时间。HSTIM的另一个显著特点是它的增量检索方法，如果之前查询相邻的时间点t，则在时间点t + t处获得较高的查询性能。本文将HSTIM与传统B+树和多版本B-树(MVBT)索引进行了多方面的比较。对真实工作负载IO跟踪文件的实验表明，对于48小时的恢复点，HSTIM可以在8.05秒内找到历史数据，而B+-tree则需要24.04秒。如果应用索引快照，HSTIM可以在3秒内减少这种检索时间。
{"title":"A High Effective Indexing and Retrieval Method Providing Block-Level Timely Recovery to Any Point-in-Time","authors":"Yonghong Sheng, Dan Xu, Dongsheng Wang","doi":"10.1109/NAS.2010.63","DOIUrl":"https://doi.org/10.1109/NAS.2010.63","url":null,"abstract":"Block-level continuous data protection (CDP) logs every disk write operation so that the disk can be rolled back to any arbitrary point-in-time within a time window. For each update operation is time stamped and logged, the indexing for such huge amounts of records is an important and challenging problem. Unfortunately, the conventional indexing methods can not efficiently record large numbers of versions and support instant “time-travel” types of queries in CDP. In this paper, we present an effective indexing method providing timely recovery to any point-in-time in comprehensive versioning systems, called the Hierarchical Spatial-Temporal Indexing Method (HSTIM). The basic principle of HSTIM is to partition the time domain and the production storage LBAs into time slice and segments respectively according to update frequency of disk IOs, and build separate index file for each segment. In order to meet the demands of instant view of history data, the metadata of production storage is independently indexed. For long-time history data retrieval requirements, index snapshot is introduced in HSTIM to reduce the retrieval time. Another distinctive feature of HSTIM is its incremental retrieval method, which achieves high query performance at time point t + t if neighboring time point t is queried previously. The paper compares HSTIM with traditional B+-tree and multi-version B-tree (MVBT) index in many aspects. Experiments with real workload IO trace files show that HSTIM can locate history data within 8.05 seconds for recovery point of 48 hours, while B+-tree consumes 24.04 seconds. If the index snapshot is applied, HSTIM can reduce such retrieval time within 3 seconds.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"302 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120864548","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}
Most solid state drives use DRAM for device’s cache, the volatile memory provides the I/O Caching ability, and maintains the drives’ mapping table (indicates the correspondence between physical unit and logical unit). However, when the drives’ power shut down unexpected, the volatile DRAM memory may lose the caching data, which did not have time to write to the drives’ storage media, so the dirty data generated. This paper proposes an efficient management scheme for low cost Solid State Drives, with low cost ASIC controller chip, only has internal SRAM memory, and no external DRAM. We use a kind of Cache Blocks: when write requests come, write in these areas first, and write in the sequentially physical place, and the limited internal SRAM for the mapping tables maintaining and data transferring. We propose some efficient methods: 1)using flash memory as cache, 2) page mapping for cache blocks regions, block mapping for data blocks regions, 3) binding two planes operation, 4) using the idle internal plane SRAM as data buffer to improve the I/O performance, without DRAM. So we avoid the dirty data when the power loses unexpected. And this scheme is energy-efficient and low cost. We test the scheme on our own SSD test board, with the pool SRAM size, the I/O performances do not decrease two much, and the random write even better about 20%, compare to the SSD with DRAM. The experiment also shows, this scheme cuts about 21% energy than the DRAM architecture. And it may be adapted in consumer electronics area.
{"title":"Cache Blocks: An Efficient Scheme for Solid State Drives without DRAM Cache","authors":"Fei Wu, Xiang Chen, Ji-guang Wan","doi":"10.1109/NAS.2010.58","DOIUrl":"https://doi.org/10.1109/NAS.2010.58","url":null,"abstract":"Most solid state drives use DRAM for device’s cache, the volatile memory provides the I/O Caching ability, and maintains the drives’ mapping table (indicates the correspondence between physical unit and logical unit). However, when the drives’ power shut down unexpected, the volatile DRAM memory may lose the caching data, which did not have time to write to the drives’ storage media, so the dirty data generated. This paper proposes an efficient management scheme for low cost Solid State Drives, with low cost ASIC controller chip, only has internal SRAM memory, and no external DRAM. We use a kind of Cache Blocks: when write requests come, write in these areas first, and write in the sequentially physical place, and the limited internal SRAM for the mapping tables maintaining and data transferring. We propose some efficient methods: 1)using flash memory as cache, 2) page mapping for cache blocks regions, block mapping for data blocks regions, 3) binding two planes operation, 4) using the idle internal plane SRAM as data buffer to improve the I/O performance, without DRAM. So we avoid the dirty data when the power loses unexpected. And this scheme is energy-efficient and low cost. We test the scheme on our own SSD test board, with the pool SRAM size, the I/O performances do not decrease two much, and the random write even better about 20%, compare to the SSD with DRAM. The experiment also shows, this scheme cuts about 21% energy than the DRAM architecture. And it may be adapted in consumer electronics area.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"129 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120899801","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}
We propose to develop a design for a reliable distributed relational database management system to safeguard sensitive information. Each day, increasingly more highly sophisticated computer attacks are occurring in the information storage systems of financial institutions, eCommerce businesses, universities, hospitals and government agencies. We urgently need to develop a secure and dependable way to safeguard our information repositories and storage systems. In this research, we propose to develop a highly robust, dependable and secure relational database management system to prevent sensitive information from being lost, stolen or corrupted. The basic idea is to i) include a (k, n) threshold-based secret sharing scheme (k ≤ n) to provide privacy and durability in order to prevent sensitive information from being lost or stolen, ii) incorporate an efficient distributed database management design to enhance system performance and minimize interfered accesses contentions, and iii) integrate private information storage (PIS) schemes to reduce communication overhead and improve robustness of the system.
{"title":"Design of a Reliable Distributed Secure Database System","authors":"Li Bai, S. Biswas, F. Ferrese","doi":"10.1109/NAS.2010.61","DOIUrl":"https://doi.org/10.1109/NAS.2010.61","url":null,"abstract":"We propose to develop a design for a reliable distributed relational database management system to safeguard sensitive information. Each day, increasingly more highly sophisticated computer attacks are occurring in the information storage systems of financial institutions, eCommerce businesses, universities, hospitals and government agencies. We urgently need to develop a secure and dependable way to safeguard our information repositories and storage systems. In this research, we propose to develop a highly robust, dependable and secure relational database management system to prevent sensitive information from being lost, stolen or corrupted. The basic idea is to i) include a (k, n) threshold-based secret sharing scheme (k ≤ n) to provide privacy and durability in order to prevent sensitive information from being lost or stolen, ii) incorporate an efficient distributed database management design to enhance system performance and minimize interfered accesses contentions, and iii) integrate private information storage (PIS) schemes to reduce communication overhead and improve robustness of the system.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116877151","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：