Статті в журналах з теми "Software distributed shared memory"

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Software distributed shared memory.

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Software distributed shared memory".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Dash, Alokika, and Brian Demsky. "Software transactional distributed shared memory." ACM SIGPLAN Notices 44, no. 4 (February 14, 2009): 297–98. http://dx.doi.org/10.1145/1594835.1504223.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Amza, C., A. L. Cox, S. Dwarkadas, Li-Jie Jin, K. Rajamani, and W. Zwaenepoel. "Adaptive protocols for software distributed shared memory." Proceedings of the IEEE 87, no. 3 (March 1999): 467–75. http://dx.doi.org/10.1109/5.747867.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Ramachandran, Umakishore, and M. Yousef A. Khalidi. "An implementation of distributed shared memory." Software: Practice and Experience 21, no. 5 (May 1991): 443–64. http://dx.doi.org/10.1002/spe.4380210503.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

ZHANG, Fu-Xin. "JIACKPT: A Recoverable Software Distributed Shared Memory System." Journal of Software 16, no. 2 (2005): 165. http://dx.doi.org/10.1360/jos160165.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Keleher, Pete, Alan L. Cox, and Willy Zwaenepoel. "Lazy release consistency for software distributed shared memory." ACM SIGARCH Computer Architecture News 20, no. 2 (May 1992): 13–21. http://dx.doi.org/10.1145/146628.139676.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Scales, Daniel J., and Kourosh Gharachorloo. "Towards transparent and efficient software distributed shared memory." ACM SIGOPS Operating Systems Review 31, no. 5 (December 1997): 157–69. http://dx.doi.org/10.1145/269005.266673.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

WANG, HSIAO-HSI, and RUEI-CHUAN CHANG. "A HYBRID COHERENCE SCHEME FOR SOFTWARE DISTRIBUTED SHARED MEMORY." International Journal of High Speed Computing 06, no. 04 (December 1994): 519–36. http://dx.doi.org/10.1142/s0129053394000251.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Manoj, N. P., K. V. Manjunath, and R. Govindarajan. "CAS-DSM: A Compiler Assisted Software Distributed Shared Memory." International Journal of Parallel Programming 32, no. 2 (April 2004): 77–122. http://dx.doi.org/10.1023/b:ijpp.0000023480.82632.87.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Bennett, John K., John B. Carter, and Willy Zwaenepoel. "Adaptive software cache management for distributed shared memory architectures." ACM SIGARCH Computer Architecture News 18, no. 2SI (June 1990): 125–34. http://dx.doi.org/10.1145/325096.325124.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Keleher, Peter J. "The Impact of Symmetry on Software Distributed Shared Memory." Journal of Parallel and Distributed Computing 60, no. 11 (November 2000): 1388–419. http://dx.doi.org/10.1006/jpdc.2000.1637.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
11

Fleisch, B. D. "Distributed shared memory in a loosely coupled distributed system." ACM SIGCOMM Computer Communication Review 17, no. 5 (October 1987): 317–27. http://dx.doi.org/10.1145/55483.55516.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
12

Feeley, Michael J., and Henry M. Levy. "Distributed shared memory with versioned objects." ACM SIGPLAN Notices 27, no. 10 (October 31, 1992): 247–62. http://dx.doi.org/10.1145/141937.141957.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
13

Lu, Honghui, Alan L. Cox, Sandhya Dwarkadas, Ramakrishnan Rajamony, and Willy Zwaenepoel. "Compiler and software distributed shared memory support for irregular applications." ACM SIGPLAN Notices 32, no. 7 (July 1997): 48–56. http://dx.doi.org/10.1145/263767.263772.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
14

Kistler, M., and L. Alvisi. "Improving the performance of software distributed shared memory with speculation." IEEE Transactions on Parallel and Distributed Systems 16, no. 9 (September 2005): 885–96. http://dx.doi.org/10.1109/tpds.2005.110.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
15

Tsanakas, P., G. Papakonstantinou, and G. Efthivoulidis. "Distributed shared-memory implementation for multitransputer systems." Information and Software Technology 34, no. 8 (August 1992): 499–506. http://dx.doi.org/10.1016/0950-5849(92)90143-d.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
16

Krishnamoorthy, S., and A. Choudhary. "A Scalable Distributed Shared Memory Architecture." Journal of Parallel and Distributed Computing 22, no. 3 (September 1994): 547–54. http://dx.doi.org/10.1006/jpdc.1994.1110.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
17

Sato, Mitsuhisa, Hiroshi Harada, Atsushi Hasegawa, and Yutaka Ishikawa. "Cluster-Enabled OpenMP: An OpenMP Compiler for the SCASH Software Distributed Shared Memory System." Scientific Programming 9, no. 2-3 (2001): 123–30. http://dx.doi.org/10.1155/2001/605217.

Повний текст джерела
Анотація:
OpenMP is attracting wide-spread interest because of its easy-to-use parallel programming model for shared memory multiprocessors. We have implemented a "cluster-enabled" OpenMP compiler for a page-based software distributed shared memory system, SCASH, which works on a cluster of PCs. It allows OpenMP programs to run transparently in a distributed memory environment. The compiler transforms OpenMP programs into parallel programs using SCASH so that shared global variables are allocated at run time in the shared address space of SCASH. A set of directives is added to specify data mapping and loop scheduling method which schedules iterations onto threads associated with the data mapping. Our experimental results show that the data mapping may greatly impact on the performance of OpenMP programs in the software distributed shared memory system. The performance of some NAS parallel benchmark programs in OpenMP is improved by using our extended directives.
Стилі APA, Harvard, Vancouver, ISO та ін.
18

Yahya, Abdelfatah Aref, and Rana Mohamad Idrees Bader. "Distributed Shared Memory Consistency Object-based Model." Journal of Computer Science 3, no. 1 (January 1, 2007): 57–61. http://dx.doi.org/10.3844/jcssp.2007.57.61.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
19

Dash, Alokika, and Brian Demsky. "Symbolic prefetching in transactional distributed shared memory." ACM SIGPLAN Notices 45, no. 5 (May 2010): 331–32. http://dx.doi.org/10.1145/1837853.1693499.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
20

Burger, Douglas C., Rahmat S. Hyder, Barton P. Miller, and David A. Wood. "Paging tradeoffs in distributed-shared-memory multiprocessors." Journal of Supercomputing 10, no. 1 (1996): 87–104. http://dx.doi.org/10.1007/bf00128100.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
21

Feldman, Jerome A., Chu-Cheow Lim, and Thomas Rauber. "The shared-memory language pSather on a distributed-memory multiprocessor." ACM SIGPLAN Notices 28, no. 1 (January 1993): 17–20. http://dx.doi.org/10.1145/156668.156677.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
22

Bennett, J. K., J. B. Carter, and W. Zwaenepoel. "Munin: distributed shared memory based on type-specific memory coherence." ACM SIGPLAN Notices 25, no. 3 (March 1990): 168–76. http://dx.doi.org/10.1145/99164.99182.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
23

Baillie, Clive F. "Comparing shared and distributed memory computers." Parallel Computing 8, no. 1-3 (October 1988): 101–10. http://dx.doi.org/10.1016/0167-8191(88)90113-5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
24

Petersen, Morten B., Anthon V. Riber, Simon T. Andersen, and Martin Schoeberl. "Time-predictable distributed shared on-chip memory." Microprocessors and Microsystems 71 (November 2019): 102896. http://dx.doi.org/10.1016/j.micpro.2019.102896.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
25

Zhang, Lixin, Mike Parker, and John Carter. "Efficient address remapping in distributed shared-memory systems." ACM Transactions on Architecture and Code Optimization 3, no. 2 (June 2006): 209–29. http://dx.doi.org/10.1145/1138035.1138039.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
26

Morris, Donald G., and David K. Lowenthal. "Accurate data redistribution cost estimation in software distributed shared memory systems." ACM SIGPLAN Notices 36, no. 7 (July 2001): 62–71. http://dx.doi.org/10.1145/568014.379570.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
27

Amza, Cristiana, Alan Cox, Karthick Rajamani, and Willy Zwaenepoel. "Tradeoffs between false sharing and aggregation in software distributed shared memory." ACM SIGPLAN Notices 32, no. 7 (July 1997): 90–99. http://dx.doi.org/10.1145/263767.263778.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
28

Dwarkadas, Sandhya, Alan L. Cox, and Willy Zwaenepoel. "An integrated compile-time/run-time software distributed shared memory system." ACM SIGOPS Operating Systems Review 30, no. 5 (December 1996): 186–97. http://dx.doi.org/10.1145/248208.237181.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
29

Dwarkadas, Sandhya, Alan L. Cox, and Willy Zwaenepoel. "An integrated compile-time/run-time software distributed shared memory system." ACM SIGPLAN Notices 31, no. 9 (September 1996): 186–97. http://dx.doi.org/10.1145/248209.237181.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
30

Liang, Tyng-Yeu, Ce-Kuen Shieh, and Jun-Qi Li. "Selecting threads for workload migration in software distributed shared memory systems." Parallel Computing 28, no. 6 (June 2002): 893–913. http://dx.doi.org/10.1016/s0167-8191(02)00071-6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
31

Yu, B. H., and P. Werstein. "Lazy home-based protocol for a software distributed shared memory system." International Journal of High Performance Computing and Networking 5, no. 5/6 (2008): 331. http://dx.doi.org/10.1504/ijhpcn.2008.025552.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
32

Nomoto, Akira, Yasuo Watanabe, Wataru Kaneko, Shugo Nakamura, and Kentaro Shimizu. "Distributed Shared Arrays: Portable Shared-Memory Programming Interface for Multiple Computer Systems." Cluster Computing 7, no. 1 (January 2004): 65–72. http://dx.doi.org/10.1023/b:clus.0000003944.78311.72.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
33

Pedersen, K. S., and B. Vinter. "Java PastSet: a structured distributed shared memory system." IEE Proceedings - Software 150, no. 2 (2003): 147. http://dx.doi.org/10.1049/ip-sen:20030135.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
34

Koelbel, C., P. Mehrotra, and J. Van Rosendale. "Supporting shared data structures on distributed memory architectures." ACM SIGPLAN Notices 25, no. 3 (March 1990): 177–86. http://dx.doi.org/10.1145/99164.99183.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
35

Schoinas, Ioannis, Babak Falsafi, Alvin R. Lebeck, Steven K. Reinhardt, James R. Larus, and David A. Wood. "Fine-grain access control for distributed shared memory." ACM SIGPLAN Notices 29, no. 11 (November 1994): 297–306. http://dx.doi.org/10.1145/195470.195575.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
36

Chandra, Rohit, Ding-Kai Chen, Robert Cox, Dror E. Maydan, Nenad Nedeljkovic, and Jennifer M. Anderson. "Data distribution support on distributed shared memory multiprocessors." ACM SIGPLAN Notices 32, no. 5 (May 1997): 334–45. http://dx.doi.org/10.1145/258916.258945.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
37

Moga, Adrian, and Michel Dubois. "A comparative evaluation of hybrid distributed shared-memory systems." Journal of Systems Architecture 55, no. 1 (January 2009): 43–52. http://dx.doi.org/10.1016/j.sysarc.2008.07.003.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
38

Castanie, Laurent, Christophe Mion, Xavier Cavin, and Bruno Levy. "Distributed Shared Memory for Roaming Large Volumes." IEEE Transactions on Visualization and Computer Graphics 12, no. 5 (September 2006): 1299–306. http://dx.doi.org/10.1109/tvcg.2006.135.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
39

Zeng, Lingfang, Yang Wang, Kenneth B. Kent, and Ziliang Xiao. "Naplus: a software distributed shared memory for virtual clusters in the cloud." Software: Practice and Experience 47, no. 9 (February 24, 2017): 1201–20. http://dx.doi.org/10.1002/spe.2486.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
40

Rybalchenko, Alexey, Dennis Klein, Mohammad Al-Turany, and Thorsten Kollegger. "Shared Memory Transport for ALFA." EPJ Web of Conferences 214 (2019): 05029. http://dx.doi.org/10.1051/epjconf/201921405029.

Повний текст джерела
Анотація:
The high data rates expected for the next generation of particle physics experiments (e.g.: new experiments at FAIR/GSI and the upgrade of CERN experiments) call for dedicated attention with respect to design of the needed computing infrastructure. The common ALICE-FAIR framework ALFA is a modern software layer, that serves as a platform for simulation, reconstruction and analysis of particle physics experiments. Beside standard services needed for simulation and reconstruction of particle physics experiments, ALFA also provides tools for data transport, configuration and deployment. The FairMQ module in ALFA offers building blocks for creating distributed software components (processes) that communicate between each other via message passing. The abstract "message passing" interface in FairMQ has at the moment three implementations: ZeroMQ, nanomsg and shared memory. The newly developed shared memory transport will be presented, that provides significant per-formance benefits for transferring large data chunks between components on the same node. The implementation in FairMQ allows users to switch between the different transports via a trivial configuration change. The design decisions, im-plementation details and performance numbers of the shared memory transport in FairMQ/ALFA will be highlighted.
Стилі APA, Harvard, Vancouver, ISO та ін.
41

Ueng, Jyh-Chang, Ce-Kuen Shieh, Tyng-Yue Liang, and Jyh-Biau Chang. "Proteus: an efficient runtime reconfigurable distributed shared memory system." Journal of Systems and Software 56, no. 3 (March 2001): 247–60. http://dx.doi.org/10.1016/s0164-1212(00)00101-1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
42

Dwarkadas, Sandhya, Peter Keleher, Alan L. Cox, and Willy Zwaenepoel. "Evaluation of release consistent software distributed shared memory on emerging network technology." ACM SIGARCH Computer Architecture News 21, no. 2 (May 1993): 144–55. http://dx.doi.org/10.1145/173682.165150.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
43

Liang, Tyng-Yeu, Jyh-Chang Ueng, Ce-Kuen Shieh, Deh-Yuan Chuang, and Jun-Qi Lee. "Distinguishing sharing types to minimize communication in software distributed shared memory systems." Journal of Systems and Software 55, no. 1 (November 2000): 73–85. http://dx.doi.org/10.1016/s0164-1212(00)00055-8.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
44

Zhuang, Yi-chang, Tyng Yue Liang, Ce-kuen Shieh, Jun-qi Lee, and Laurence Tianruo Yang. "A Group-Based Load Balance Scheme for Software Distributed Shared Memory Systems." Journal of Supercomputing 28, no. 3 (June 2004): 295–309. http://dx.doi.org/10.1023/b:supe.0000022101.41799.cc.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
45

Chapman, B., F. Bregier, A. Patil, and A. Prabhakar. "Achieving performance under OpenMP on ccNUMA and software distributed shared memory systems." Concurrency and Computation: Practice and Experience 14, no. 8-9 (2002): 713–39. http://dx.doi.org/10.1002/cpe.646.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
46

Vidyarthi, Deo Prakash, and Kirti Rani. "Distributed shared memory for object allocation in DCS." International Journal of Information Technology and Management 5, no. 1 (2006): 87. http://dx.doi.org/10.1504/ijitm.2006.008716.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
47

Yu, Qian, Tong Li, Zhong Wen Xie, Na Zhao, and Ying Lin. "Distributed Computing Design Methods for Multicore Application Programming." Advanced Materials Research 756-759 (September 2013): 1295–99. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.1295.

Повний текст джерела
Анотація:
In order to solve the serial execution caused by multithreaded concurrent access to shared data and realize the dynamic load balance of tasks on shared memory symmetric multi-processor (multi-core) computing platform, new design methods are presented. By presenting multicore distributed locks, multicore shared data localization, multicore distributed queue, the new design methods can greatly decrease the number of accessing the shared data and realize the dynamic load balance of tasks. For illustration, design scheme of multicore task manager of server software are given by using new design methods. Results shows the new design methods reduce the number of access shared resources, partially resolve the serial execution of cooperative threads and realize the dynamic task balance of server software, which validate the superiority of this approach.
Стилі APA, Harvard, Vancouver, ISO та ін.
48

Oortwijn, Wytse, Dilian Gurov, and Marieke Huisman. "An Abstraction Technique for Verifying Shared-Memory Concurrency." Applied Sciences 10, no. 11 (June 5, 2020): 3928. http://dx.doi.org/10.3390/app10113928.

Повний текст джерела
Анотація:
Modern concurrent and distributed software is highly complex. Techniques to reason about the correct behaviour of such software are essential to ensure its reliability. To be able to reason about realistic programs, these techniques must be modular and compositional as well as practical by being supported by automated tools. However, many existing approaches for concurrency verification are theoretical and focus primarily on expressivity and generality. This paper contributes a technique for verifying behavioural properties of concurrent and distributed programs that balances expressivity and usability. The key idea of the approach is that program behaviour is abstractly modelled using process algebra, and analysed separately. The main difficulty is presented by the typical abstraction gap between program implementations and their models. Our approach bridges this gap by providing a deductive technique for formally linking programs with their process-algebraic models. Our verification technique is modular and compositional, is proven sound with Coq, and has been implemented in the automated concurrency verifier VerCors. Moreover, our technique is demonstrated on multiple case studies, including the verification of a leader election protocol.
Стилі APA, Harvard, Vancouver, ISO та ін.
49

Monchiero, Matteo, Gianluca Palermo, Cristina Silvano, and Oreste Villa. "Exploration of distributed shared memory architectures for NoC-based multiprocessors." Journal of Systems Architecture 53, no. 10 (October 2007): 719–32. http://dx.doi.org/10.1016/j.sysarc.2007.01.008.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
50

Stone, Christopher, and Suresh Menon. "Large-eddy simulations on distributed shared memory clusters." Journal of Parallel and Distributed Computing 64, no. 10 (October 2004): 1103–12. http://dx.doi.org/10.1016/j.jpdc.2004.08.001.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії