Kooperativer Bibliotheksverbund

Berlin Brandenburg

and
and

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Mirtaheri, Seyedeh Leili  (13)
Language
Year
  • 1
    Language: English
    In: The Journal of Supercomputing, 2012, Vol.59(1), pp.548-567
    Description: Interprocess communication (IPC) is a well-known technique commonly used by programs running on homogeneous distributed systems. However, it cannot be used readily and efficiently by programs running on heterogeneous distributed systems. This is because it must be given a uniform interface either by a set of middleware or more efficiently properly ported to the kernel of all varieties of open source and closed source proprietary operating systems running on heterogeneous nodes of distributed systems. This is particularly problematic to achieve when the kernel code of closed source operating systems are inaccessible to third parties. We propose an alternative nonproprietary approach to enable the use of IPC in heterogeneous distributed systems by wrapping IPC calls from the kernel of closed source operating systems, and converting them into equivalent IPC calls that are efficiently implemented inside the kernel code of open source operating systems. To show the superiority of our approach, we developed a wrapper for converting MS-Windows IPC calls into equivalent Linux IPC calls and benched our approach on a hybrid computer cluster running both types of operating systems.
    Keywords: Hybrid cluster ; Wrapper ; Open source ; Closed source ; Interprocess communication (IPC) ; Kernel level ; User level ; Message ; Remote procedure call
    ISSN: 0920-8542
    E-ISSN: 1573-0484
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Language: English
    In: Journal of Applied Social Psychology, June, 2013, Vol.43(6), p.1211(17)
    Description: Byline: Ehsan Mousavi Khaneghah, Seyedeh Leili Mirtaheri, Behrouz Minaei-Bidgoli, Mohsen Sharifi, Mohammad Reza Mani Yekta, Abbas Saleh Ardestani, Zarrintaj Bornaee Abstract This paper presents a model for resolving two main issues of time in e-commerce. The first issue is the time value of e-commerce that represents the value of each moment of the commerce time from the perspective of buyers and sellers. Buyers and sellers can use this model to calculate the time value at each moment of time and accordingly decide whether it is profitable to buy or sell at that moment. The second issue is to allow buyers or sellers to increase their savings or decrease their costs by changing each of the factors governing the time value model of the concerned e-commerce. We present relevant model specifically for Amazon e-commerce to present a proof of concept of our proposed models. Author Affiliation:
    Keywords: E-commerce -- Analysis
    ISSN: 0021-9029
    E-ISSN: 15591816
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Language: English
    In: The Journal of Supercomputing, 2010, Vol.52(2), pp.149-170
    Description: Traditional Peer-to-Peer (P2P) systems were restricted to sharing of files on the Internet. Although some of the more recent P2P distributed systems have tried to support transparent sharing of other types of resources, like computer processing power, but none allow and support sharing of all types of resources available on the Internet. This is mainly because the resource management part of P2P systems are custom designed in support of specific features of only one type of resource, making simultaneous access to all types of resources impractical. Another shortcoming of existing P2P systems is that they follow a client/server model of resource sharing that makes them structurally constrained and dependent on dedicated servers (resource managers). Clients must get permission from a limited number of servers to share or access resources, and resource management mechanisms run on these servers. Because resource management by servers is not dynamically reconfigurable, such P2P systems are not scalable to the ever growing extent of Internet. We present an integrated framework for sharing of all types of resources in P2P systems by using a dynamic structure for managing four basic types of resources, namely process , file , memory , and I/O , in the same way they are routinely managed by operating systems. The proposed framework allows P2P systems to use dynamically reconfigurable resource management mechanisms where each machine in the P2P system can at the same time serve both as a server and as a client. The pattern of requests for shared resources at a given time identifies which machines are currently servers and which ones are currently clients. The client server pattern changes with changes in the pattern of requests for distributed resources. Scalable P2P systems with dynamically reconfigurable structures can thus be built using our proposed resource management mechanisms. This dynamic structure also allows for the interoperability of different P2P systems.
    Keywords: P2P distributed systems ; Integrated resource management ; Resource sharing ; Framework ; Operating system
    ISSN: 0920-8542
    E-ISSN: 1573-0484
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Language: English
    In: Computer Networks The International Journal of Computer and Telecommunications Networking, Feb 11, 2014, Vol.59, p.213(14)
    Description: To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.bjp.2013.10.012 Byline: Seyedeh Leili Mirtaheri, Mohsen Sharifi Abstract: In this paper, we propose an efficient resource discovery framework allowing pure unstructured peer-to-peer systems to respond to requests at run time with a high success rate while preserving the local autonomy of member machines. There are five units in the proposed framework that respectively gather information about the status of resources, make decisions, detect the states of member machines, discover resources to respond to requests in normal and dynamic conditions, and balance the load of local machines. Efficient resource discovery is achieved by the deployment of a newly introduced mechanism that is placed on every machine allowing it to figure out its states before and after accepting other machines' requests for its resources using a state model and deciding whether to accept or reject those requests. This state model accurately estimates the machine's state based on the resources and processes of the machine before and after accepting the request. We have experimentally compared the proposed mechanism with random, learning-based, and state-based search mechanisms with regard to the number of missed requests, network bandwidth due to transferred messages, number of associated machines in a discovery operation, time required to process information in discovery operation, processing time in machines, and the number of faults per request. The results show significant improvement of some of these parameters, specially network bandwidth and the number of missed requests in a dynamic condition, under our framework. Article History: Received 9 January 2013; Revised 28 August 2013; Accepted 28 October 2013
    Keywords: Peer To Peer Networking -- Analysis
    ISSN: 1389-1286
    Source: Cengage Learning, Inc.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Language: English
    In: Computer Networks The International Journal of Computer and Telecommunications Networking, Feb 11, 2014, Vol.59, p.213(14)
    Description: To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.bjp.2013.10.012 Byline: Seyedeh Leili Mirtaheri, Mohsen Sharifi Abstract: In this paper, we propose an efficient resource discovery framework allowing pure unstructured peer-to-peer systems to respond to requests at run time with a high success rate while preserving the local autonomy of member machines. There are five units in the proposed framework that respectively gather information about the status of resources, make decisions, detect the states of member machines, discover resources to respond to requests in normal and dynamic conditions, and balance the load of local machines. Efficient resource discovery is achieved by the deployment of a newly introduced mechanism that is placed on every machine allowing it to figure out its states before and after accepting other machines' requests for its resources using a state model and deciding whether to accept or reject those requests. This state model accurately estimates the machine's state based on the resources and processes of the machine before and after accepting the request. We have experimentally compared the proposed mechanism with random, learning-based, and state-based search mechanisms with regard to the number of missed requests, network bandwidth due to transferred messages, number of associated machines in a discovery operation, time required to process information in discovery operation, processing time in machines, and the number of faults per request. The results show significant improvement of some of these parameters, specially network bandwidth and the number of missed requests in a dynamic condition, under our framework. Article History: Received 9 January 2013; Revised 28 August 2013; Accepted 28 October 2013
    Keywords: Peer To Peer Networking -- Analysis
    ISSN: 1389-1286
    Source: Cengage Learning, Inc.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    In: Journal of Applied Social Psychology, June 2013, Vol.43(6), pp.1211-1227
    Description: This paper presents a model for resolving two main issues of time in e‐commerce. The first issue is the time value of e‐commerce that represents the value of each moment of the commerce time from the perspective of buyers and sellers. Buyers and sellers can use this model to calculate the time value at each moment of time and accordingly decide whether it is profitable to buy or sell at that moment. The second issue is to allow buyers or sellers to increase their savings or decrease their costs by changing each of the factors governing the time value model of the concerned e‐commerce. We present relevant model specifically for Amazon e‐commerce to present a proof of concept of our proposed models.
    Keywords: Sociology & Social History;
    ISSN: 0021-9029
    E-ISSN: 1559-1816
    Source: John Wiley & Sons, Inc.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Language: English
    In: Computer Networks, 11 February 2014, Vol.59, pp.213-226
    Description: In this paper, we propose an efficient resource discovery framework allowing pure unstructured peer-to-peer systems to respond to requests at run time with a high success rate while preserving the local autonomy of member machines. There are five units in the proposed framework that respectively gather information about the status of resources, make decisions, detect the states of member machines, discover resources to respond to requests in normal and dynamic conditions, and balance the load of local machines. Efficient resource discovery is achieved by the deployment of a newly introduced mechanism that is placed on every machine allowing it to figure out its states before and after accepting other machines’ requests for its resources using a state model and deciding whether to accept or reject those requests. This state model accurately estimates the machine’s state based on the resources and processes of the machine before and after accepting the request. We have experimentally compared the proposed mechanism with random, learning-based, and state-based search mechanisms with regard to the number of missed requests, network bandwidth due to transferred messages, number of associated machines in a discovery operation, time required to process information in discovery operation, processing time in machines, and the number of faults per request. The results show significant improvement of some of these parameters, specially network bandwidth and the number of missed requests in a dynamic condition, under our framework.
    Keywords: Resource Discovery ; Pure Unstructured Peer-to-Peer Systems ; Learning ; State-Based Search ; Engineering
    ISSN: 1389-1286
    E-ISSN: 1872-7069
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Language: English
    In: Computing in Science & Engineering, September 2014, Vol.16(5), pp.76-85
    Description: In this article, the authors investigate the development of Multiplexed Information and Computing Service (Multics) and Plan 9, and illustrate how these approaches have influenced today's computing systems. "Computing service as an electricity service"' is the core mission of the distributed computing systems introduced by the Multics project in 1965. In developing the new generation of distributed computing systems, researchers have faced numerous obstacles, though many have already been addressed and dispelled by pioneer systems. Security, scalability, access transparency, resource-sharing, and dynamic reconfiguration are examples originally introduced and considered by both Multics and Plan 9. Moreover, many novel approaches have employed the basic ideas of these systems. However, there are further innovations that could be helpful in designing prospective distributed computing systems. As a result, studying previous systems' objectives and current statuses can facilitate new solutions and help point to possible failures.
    Keywords: Information Processing ; Operating Systems ; Distributed Computing ; Program Processors ; Computer Architecture ; Computer Security ; Distributed Computing ; Operating System ; Multics ; Plan 9 ; Cluster Computing ; Grid Computing ; Cloud Computing ; I/O Streams and Data Sharing ; Resource Sharing ; Dynamic Reconfiguration ; Namespaces ; File-Mapped Resources ; Scientific Computing ; Sciences (General) ; Applied Sciences
    ISSN: 1521-9615
    E-ISSN: 1558-366X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Language: English
    In: 2011 IEEE 3rd International Conference on Communication Software and Networks, May 2011, pp.499-503
    Description: Parameters affecting the functionality of an operating system's memory management unit depend on a number of factors such as allocation and deallocation strategies, localization, internal and external fragmentation, regional clustering, allocation and deallocation speeds, multi-threading, reusability, wasted memory reusability, implementation level and dynamicity. In this paper, we examine different memory allocation methods used in the BSD operating system as well as parameters affecting the functionality of its memory management unit extracted from these methods. Besides identifying the relationships and dependencies between these parameters, we report our experimental measurements of the effect of each parameter on the performance of different memory management methods used in BSD. Our evaluations not only provide a comparative view of different allocation methods in BSD that have been deployed over time to complement each other, they also put into perspective different memory allocation methods used in different operating systems with respect to parameters such as multithreading ability, number of requests served and memory fragmentation rate.
    Keywords: Resource Management ; Instruction Sets ; Hardware ; Computers ; Kernel ; Operating System Kernel ; Memory Management ; Memory Allocation Methods ; Performance
    ISBN: 9781612844855
    ISBN: 1612844855
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Source: IEEE Journals & Magazines 
    Source: IEEE eBooks
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Language: English
    In: Lecture Notes in Computer Science, 2012, Vol.LNCS-7513, pp.77-84
    Description: Load balancing is one of the main challenges of structured P2P systems that use distributed hash tables (DHT) to map data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead...
    Keywords: Computer Science ; Structured P2p Systems ; Load Balancing ; Node Movement ; Replication ; Computer Science
    ISBN: 9783642356056
    ISSN: 03029743
    E-ISSN: 16113349
    Source: Hyper Article en Ligne (CCSd)
    Source: Hyper Article en Ligne Open Access (CCSd)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages