Einloggen

Thematische Bibliographien / Distributed processing / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Distributed processing.

Zeitschriftenartikel zum Thema „Distributed processing“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 30. Juli 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Distributed processing" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Fox, Peter T., und Karl J. Friston. „Distributed processing; distributed functions?“ NeuroImage 61, Nr. 2 (Juni 2012): 407–26. http://dx.doi.org/10.1016/j.neuroimage.2011.12.051.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

ME, E. Sankaran. „Distributed Control Systems in Food Processing“. International Journal of Trend in Scientific Research and Development Volume-3, Issue-1 (31.12.2018): 27–30. http://dx.doi.org/10.31142/ijtsrd18921.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Stewart, Ian. „Highly distributed processing“. Nature 337, Nr. 6202 (Januar 1989): 13. http://dx.doi.org/10.1038/337013a0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Scherr, A. L. „SAA distributed processing“. IBM Systems Journal 27, Nr. 3 (1988): 370–83. http://dx.doi.org/10.1147/sj.273.0370.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Scherr, A. L. „Distributed data processing“. IBM Systems Journal 38, Nr. 2.3 (1999): 354–74. http://dx.doi.org/10.1147/sj.382.0354.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Bowen, Dyfed. „Open distributed processing“. Computer Networks and ISDN Systems 23, Nr. 1-3 (Januar 1991): 195–201. http://dx.doi.org/10.1016/0169-7552(91)90107-n.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Naz, Najia, Abdul Haseeb Malik, Abu Bakar Khurshid, Furqan Aziz, Bader Alouffi, M. Irfan Uddin und Ahmed AlGhamdi. „Efficient Processing of Image Processing Applications on CPU/GPU“. Mathematical Problems in Engineering 2020 (10.10.2020): 1–14. http://dx.doi.org/10.1155/2020/4839876.

Der volle Inhalt der Quelle

Annotation:

Heterogeneous systems have gained popularity due to the rapid growth in data and the need for processing this big data to extract useful information. In recent years, many healthcare applications have been developed which use machine learning algorithms to perform tasks such as image classification, object detection, image segmentation, and instance segmentation. The increasing amount of big visual data requires images to be processed efficiently. It is common that we use heterogeneous systems for such type of applications, as processing a huge number of images on a single PC may take months of computation. In heterogeneous systems, data are distributed on different nodes in the system. However, heterogeneous systems do not distribute images based on the computing capabilities of different types of processors in the node; therefore, a slow processor may take much longer to process an image compared to a faster processor. This imbalanced workload distribution observed in heterogeneous systems for image processing applications is the main cause of inefficient execution. In this paper, an efficient workload distribution mechanism for image processing applications is introduced. The proposed approach consists of two phases. In the first phase, image data are divided into an ideal split size and distributed amongst nodes, and in the second phase, image data are further distributed between CPU and GPU according to their computation speeds. Java bindings for OpenCL are used to configure both the CPU and GPU to execute the program. The results have demonstrated that the proposed workload distribution policy efficiently distributes the images in a heterogeneous system for image processing applications and achieves 50% improvements compared to the current state-of-the-art programming frameworks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Sutherland, Stuart. „Cognition: Parallel distributed processing“. Nature 323, Nr. 6088 (Oktober 1986): 486. http://dx.doi.org/10.1038/323486a0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Nierstrasz, Oscar, Alan Snyder, Anthony S. Williams und William Cook. „Open distributed processing (panel)“. ACM SIGPLAN OOPS Messenger 5, Nr. 2 (April 1994): 67–71. http://dx.doi.org/10.1145/260304.260322.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

KRITHIVASAN, KAMALA, N. SAKTHI BALAN und PRAHLADH HARSHA. „DISTRIBUTED PROCESSING IN AUTOMATA“. International Journal of Foundations of Computer Science 10, Nr. 04 (Dezember 1999): 443–63. http://dx.doi.org/10.1142/s0129054199000319.

Der volle Inhalt der Quelle

Annotation:

With distributed computing beginning to play a major role in modern Computer Science, the theory of grammar systems and distributed automata has been developed in order to model distributed computing. In this paper, we introduce the notion of distributed automata in the sequential sense. Distributed Automata are a group of automata working in unison to accept one language. We build the theory of distributed for FSA and PDA in different modes of acceptance like the t-mode, *-mode, =k-mode, ≤k-mode and ≥k-mode. We then analyze the acceptance power of each automata in all the above modes. We present proofs that distributed FSAs do not have any additional power over "centralized" FSAs in any of the modes, while distributed PDAs with only two components are as powerful as Turing Machines in all of the modes. We give proofs for the equivalence of all modes in the case of PDAs. We also study a restricted version of distributed PDA called k-turn distributed PDA.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Smith, J. E. „Instruction-level distributed processing“. Computer 34, Nr. 4 (April 2001): 59–65. http://dx.doi.org/10.1109/2.917541.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Kolcun, Roman, David E. Boyle und Julie A. McCann. „Efficient Distributed Query Processing“. IEEE Transactions on Automation Science and Engineering 13, Nr. 3 (Juli 2016): 1230–46. http://dx.doi.org/10.1109/tase.2016.2530941.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Dawson, Michael R. W., und Don P. Schopflocher. „Autonomous processing in parallel distributed processing networks“. Philosophical Psychology 5, Nr. 2 (Januar 1992): 199–219. http://dx.doi.org/10.1080/09515089208573056.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Hoppen, Martin, Ralf Waspe, Malte Rast und Juergen Rossmann. „Distributed Information Processing and Rendering for 3D Simulation Applications“. International Journal of Computer Theory and Engineering 6, Nr. 3 (2014): 247–53. http://dx.doi.org/10.7763/ijcte.2014.v6.870.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Bar-Ness, Yeheskel, Petar Popovski, Osvaldo Simeone und Umberto Spagnolini. „Distributed processing for wireless networks“. Journal of Communications and Networks 11, Nr. 4 (August 2009): 323–26. http://dx.doi.org/10.1109/jcn.2009.6391345.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Schlichter, Johann. „Collaboration in distributed document processing“. ACM SIGOIS Bulletin 13, Nr. 1 (April 1992): 32–33. http://dx.doi.org/10.1145/130643.130682.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Wolfson, Ouri, und Avi Silberschatz. „Distributed processing of logic programs“. ACM SIGMOD Record 17, Nr. 3 (Juni 1988): 329–36. http://dx.doi.org/10.1145/971701.50242.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Frasciello, Michael J., und John Richardson. „Distributed processing and Windows NT“. Library Consortium Management: An International Journal 1, Nr. 3/4 (Dezember 1999): 76–83. http://dx.doi.org/10.1108/14662769910305768.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Ye, Haiwei, Brigitte Kerhervé und Gregor V. Bochmann. „QoS-based Distributed Query Processing“. Ingénierie des systèmes d'information 9, Nr. 5-6 (24.12.2004): 205–34. http://dx.doi.org/10.3166/isi.9.5-6.205-234.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Tamura, Shinsuke, Yasukuni Okataku und Toshibumi Seki. „Intellectual Distributed Processing System Architechture“. IEEJ Transactions on Electronics, Information and Systems 108, Nr. 6 (1988): 393–400. http://dx.doi.org/10.1541/ieejeiss1987.108.6_393.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Daniels, Dean S., Alfred Z. Spector und Dean S. Thompson. „Distributed logging for transaction processing“. ACM SIGMOD Record 16, Nr. 3 (Dezember 1987): 82–96. http://dx.doi.org/10.1145/38714.38728.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Kennedy, Scott D., und Andrew B. Schwartz. „Distributed processing of movement signaling“. Proceedings of the National Academy of Sciences 116, Nr. 52 (23.12.2019): 26266–73. http://dx.doi.org/10.1073/pnas.1902296116.

Der volle Inhalt der Quelle

Annotation:

Basic neurophysiological research with monkeys has shown how neurons in the motor cortex have firing rates tuned to movement direction. This original finding would have been difficult to uncover without the use of a behaving primate paradigm in which subjects grasped a handle and moved purposefully to targets in different directions. Subsequent research, again using behaving primate models, extended these findings to continuous drawing and to arm and hand movements encompassing action across multiple joints. This research also led to robust extraction algorithms in which information from neuronal populations is used to decode movement intent. The ability to decode intended movement provided the foundation for neural prosthetics in which brain-controlled interfaces are used by paralyzed human subjects to control computer cursors or high-performance motorized prosthetic arms and hands. This translation of neurophysiological laboratory findings to therapy is a clear example of why using nonhuman primates for basic research is valuable for advancing treatment of neurological disorders. Recent research emphasizes the distribution of intention signaling through neuronal populations and shows how many movement parameters are encoded simultaneously. In addition to direction and velocity, the arm’s impedance has now been found to be encoded as well. The ability to decode motion and force from neural populations will make it possible to extend neural prosthetic paradigms to precise interaction with objects, enabling paralyzed individuals to perform many tasks of daily living.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Jayasekara, Sachini, Sameera Kannangara, Tishan Dahanayakage, Isuru Ranawaka, Srinath Perera und Vishaka Nanayakkara. „Wihidum: Distributed complex event processing“. Journal of Parallel and Distributed Computing 79-80 (Mai 2015): 42–51. http://dx.doi.org/10.1016/j.jpdc.2015.03.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Zajac, Bernard P. „Distributed data processing: New problems“. Computers & Security 7, Nr. 3 (Juni 1988): 249–50. http://dx.doi.org/10.1016/0167-4048(88)90027-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

SAYED, A. H., und C. G. LOPES. „Adaptive Processing over Distributed Networks“. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E90-A, Nr. 8 (01.08.2007): 1504–10. http://dx.doi.org/10.1093/ietfec/e90-a.8.1504.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Tsuchiya, M., und Douglas C. Shannon. „Simulation of distributed processing networks“. Computer Networks and ISDN Systems 11, Nr. 1 (Januar 1986): 15–27. http://dx.doi.org/10.1016/0169-7552(86)90026-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Casazza, Peter G., Gitta Kutyniok und Shidong Li. „Fusion frames and distributed processing“. Applied and Computational Harmonic Analysis 25, Nr. 1 (Juli 2008): 114–32. http://dx.doi.org/10.1016/j.acha.2007.10.001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Hui, S. C., K. Y. Chan und G. Y. Qian. „Distributed fax message processing system“. Journal of Network and Computer Applications 20, Nr. 2 (April 1997): 171–90. http://dx.doi.org/10.1006/jnca.1997.0045.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Segev, Arie. „Algorithms for distributed data processing“. Computers & Operations Research 14, Nr. 2 (Januar 1987): 145–62. http://dx.doi.org/10.1016/0305-0548(87)90006-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Venkatasubramanian, S. „Green IoT Edge Computing Towards Sustainable and Distributed Data Processing“. International Journal of Research Publication and Reviews 4, Nr. 9 (September 2023): 413–36. http://dx.doi.org/10.55248/gengpi.4.923.52454.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

K, Sornalakshmi. „Dynamic Operator Scaling for Distributed Stream Processing Systems for Fluctuating Streams“. Journal of Advanced Research in Dynamical and Control Systems 12, SP7 (25.07.2020): 2815–21. http://dx.doi.org/10.5373/jardcs/v12sp7/20202422.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Yamasaki, Nobuyuki, und Toshihiro Matsui. „Functionally distributed responsive micro controller for distributed real-time processing“. Computer Standards & Interfaces 20, Nr. 6-7 (März 1999): 429. http://dx.doi.org/10.1016/s0920-5489(99)90857-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Tran, Tri Minh, und Byung Suk Lee. „Distributed Adaptive Windowed Stream Join Processing“. International Journal of Distributed Systems and Technologies 2, Nr. 2 (April 2011): 59–81. http://dx.doi.org/10.4018/jdst.2011040104.

Der volle Inhalt der Quelle

Annotation:

This paper presents an adaptive framework for processing a window-based multi-way join query over distributed data streams. The framework integrates distributed plan modification and distributed plan migration within the same scope by using a building block called the node operator set (NOS). An NOS is housed in each node that participates in the join execution, and specifies the set of atomic operations to be performed locally at the host node to execute its share of the global execution plan. The plan modification and migration techniques presented are for the case of updating the NOSs centralized at a single node and the case of updating them distributed at each node. The plan modification is triggered by the change of stream statistics and adjusts the join execution order and placement greedily to satisfy a cost invariant. The plan migration uses the distributed track strategy to accelerate the migration of window extents to new nodes. The migration of all window extents is synchronized. Experiments confirm the effectiveness of the developed adaptive framework on reducing the join execution cost and indicate a small additional adaptation-overhead for distributing the NOS update.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Lederman, Susan J., Roger A. Browse und Roberta L. Klatzky. „Haptic processing of spatially distributed information“. Perception & Psychophysics 44, Nr. 3 (Mai 1988): 222–32. http://dx.doi.org/10.3758/bf03206291.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Chen, Po-Chih, und Palghat Vaidyanathan. „Distributed Algorithms for Array Signal Processing“. IEEE Transactions on Signal Processing 69 (2021): 4607–22. http://dx.doi.org/10.1109/tsp.2021.3101015.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Darmont, Jérôme, Boris Novikov, Robert Wrembel und Ladjel Bellatreche. „Data processing in modern distributed architectures“. Information Systems 104 (Februar 2022): 101936. http://dx.doi.org/10.1016/j.is.2021.101936.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Ras, Zbigniew W. „Query Processing in Distributed Information Systems“. Fundamenta Informaticae 15, Nr. 3-4 (01.08.1991): 381–97. http://dx.doi.org/10.3233/fi-1991-153-411.

Der volle Inhalt der Quelle

Annotation:

In our model of a distributed information system, two information structures are maintained – the application database and the (routing) database used to route queries in a computer network. Any site of a distributed information system which does not understand some attribute values used in a query has to search for a site which can explain them. The information stored in routing database has a strong impact on the speed of this search. In [5], we propose that each site learns from its neighbors the descriptions of all unknown attribute values used in queries. These descriptions are represented in the form of rules and stored in dictionaries added to all sites of a distributed information system. This extended distributed system with dictionaries is called intelligent.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

SrinivasaRao, P., V. P. C Rao und A. Govardhan. „Priority based Distributed Job Processing System“. International Journal of Computer Applications 60, Nr. 17 (18.12.2012): 13–17. http://dx.doi.org/10.5120/9783-4319.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Wiggins, R. E. „Distributed information processing: trends and implications“. Aslib Proceedings 37, Nr. 2 (Februar 1985): 73–90. http://dx.doi.org/10.1108/eb050955.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Yosuf, Barzan A., Mohamed Musa, Taisir Elgorashi und Jaafar Elmirghani. „Energy Efficient Distributed Processing for IoT“. IEEE Access 8 (2020): 161080–108. http://dx.doi.org/10.1109/access.2020.3020744.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Tarasov, E. N. „Ergatic Distributed Data-Processing Systems Control“. MEHATRONIKA, AVTOMATIZACIA, UPRAVLENIE 17, Nr. 4 (April 2016): 245–49. http://dx.doi.org/10.17587/mau.17.245-249.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Stanoi, Ioana, George Mihaila, Themis Palpanas und Christian Lang. „WhiteWater: Distributed Processing of Fast Streams“. IEEE Transactions on Knowledge and Data Engineering 19, Nr. 9 (September 2007): 1214–26. http://dx.doi.org/10.1109/tkde.2007.1056.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Bodorik, P., J. S. Riordon und J. S. Pyra. „Deciding to correct distributed query processing“. IEEE Transactions on Knowledge and Data Engineering 4, Nr. 3 (Juni 1992): 253–65. http://dx.doi.org/10.1109/69.142016.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Bodorik, P., und J. S. Riordon. „Threshold Values for Processing Distributed Queries“. Computer Journal 34, Nr. 6 (01.12.1991): 551–58. http://dx.doi.org/10.1093/comjnl/34.6.551.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Liu, C., und C. Yu. „Performance issues in distributed query processing“. IEEE Transactions on Parallel and Distributed Systems 4, Nr. 8 (1993): 889–905. http://dx.doi.org/10.1109/71.238624.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Banks, D. J., P. Degenaar und C. Toumazou. „Distributed current-mode image processing filters“. Electronics Letters 41, Nr. 22 (2005): 1201. http://dx.doi.org/10.1049/el:20052971.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Baumgurtel, H. „Distributed constraint processing for production logistics“. IEEE Intelligent Systems 15, Nr. 1 (Januar 2000): 40–48. http://dx.doi.org/10.1109/5254.820328.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Banks, Richard, Peter Furniss, Klaus Heien und H. Rüdiger Wiehle. „OSI distributed transaction processing commitment optimizations“. ACM SIGCOMM Computer Communication Review 28, Nr. 5 (Oktober 1998): 61–75. http://dx.doi.org/10.1145/303297.303308.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Hochreiner, Christoph, Stefan Schulte, Schahram Dustdar und Freddy Lecue. „Elastic Stream Processing for Distributed Environments“. IEEE Internet Computing 19, Nr. 6 (November 2015): 54–59. http://dx.doi.org/10.1109/mic.2015.118.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Smith, Jim, Paul Watson, Anastasios Gounaris, Norman W. Paton, Alvaro A. A. Fernandes und Rizos Sakellariou. „Distributed Query Processing on the Grid“. International Journal of High Performance Computing Applications 17, Nr. 4 (November 2003): 353–67. http://dx.doi.org/10.1177/10943420030174002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!