X

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Association for Computing Machinery (ACM)  (7)
  • Computer Science  (7)
Type of Medium
Publisher
  • Association for Computing Machinery (ACM)  (7)
Person/Organisation
Language
Years
Subjects(RVK)
  • Computer Science  (7)
RVK
  • 1
    Online Resource
    Online Resource
    Browsix : Bridging the Gap Between Unix and the Browser
    Association for Computing Machinery (ACM) ; 2017
    In:  ACM SIGARCH Computer Architecture News Vol. 45, No. 1 ( 2017-05-11), p. 253-266
    Details
    In: ACM SIGARCH Computer Architecture News, Association for Computing Machinery (ACM), Vol. 45, No. 1 ( 2017-05-11), p. 253-266
    Abstract: Applications written to run on conventional operating systems typically depend on OS abstractions like processes, pipes, signals, sockets, and a shared file system. Porting these applications to the web currently requires extensive rewriting or hosting significant portions of code server-side because browsers present a nontraditional runtime environment that lacks OS functionality. This paper presents Browsix, a framework that bridges the considerable gap between conventional operating systems and the browser, enabling unmodified programs expecting a Unix-like environment to run directly in the browser. Browsix comprises two core parts: (1) a JavaScript-only system that makes core Unix features (including pipes, concurrent processes, signals, sockets, and a shared file system) available to web applications; and (2) extended JavaScript runtimes for C, C++, Go, and Node.js that support running programs written in these languages as processes in the browser. Browsix supports running a POSIX shell, making it straightforward to connect applications together via pipes. We illustrate Browsix's capabilities via case studies that demonstrate how it eases porting legacy applications to the browser and enables new functionality. We demonstrate a Browsix-enabled LaTeX editor that operates by executing unmodified versions of pdfLaTeX and BibTeX. This browser-only LaTeX editor can render documents in seconds, making it fast enough to be practical. We further demonstrate how Browsix lets us port a client-server application to run entirely in the browser for disconnected operation. Creating these applications required less than 50 lines of glue code and no code modifications, demonstrating how easily Browsix can be used to build sophisticated web applications from existing parts without modification.
    Type of Medium: Online Resource
    ISSN: 0163-5964
    URL: Article
    DOI: 10.1145/3093337.3037727
    RVK:
    SS 1985
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2017
    detail.hit.zdb_id: 2088489-8
    detail.hit.zdb_id: 186012-4
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 2
    Online Resource
    Online Resource
    Hoard : a scalable memory allocator for multithreaded applications
    Association for Computing Machinery (ACM) ; 2000
    In:  ACM SIGARCH Computer Architecture News Vol. 28, No. 5 ( 2000-12), p. 117-128
    Details
    In: ACM SIGARCH Computer Architecture News, Association for Computing Machinery (ACM), Vol. 28, No. 5 ( 2000-12), p. 117-128
    Abstract: Parallel, multithreaded C and C++ programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these applications, the memory allocator is often a bottleneck that severely limits program performance and scalability on multiprocessor systems. Previous allocators suffer from problems that include poor performance and scalability, and heap organizations that introduce false sharing. Worse, many allocators exhibit a dramatic increase in memory consumption when confronted with a producer-consumer pattern of object allocation and freeing. This increase in memory consumption can range from a factor of P (the number of processors) to unbounded memory consumption.This paper introduces Hoard, a fast, highly scalable allocator that largely avoids false sharing and is memory efficient. Hoard is the first allocator to simultaneously solve the above problems. Hoard combines one global heap and per-processor heaps with a novel discipline that provably bounds memory consumption and has very low synchronization costs in the common case. Our results on eleven programs demonstrate that Hoard yields low average fragmentation and improves overall program performance over the standard Solaris allocator by up to a factor of 60 on 14 processors, and up to a factor of 18 over the next best allocator we tested.
    Type of Medium: Online Resource
    ISSN: 0163-5964
    URL: Article
    DOI: 10.1145/378995.379232
    RVK:
    SS 1985
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2000
    detail.hit.zdb_id: 2088489-8
    detail.hit.zdb_id: 186012-4
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 3
    Online Resource
    Online Resource
    Session details: Recognizing software and concurrency bugs
    Association for Computing Machinery (ACM) ; 2011
    In:  ACM SIGARCH Computer Architecture News Vol. 39, No. 1 ( 2011-03-17)
    Details
    In: ACM SIGARCH Computer Architecture News, Association for Computing Machinery (ACM), Vol. 39, No. 1 ( 2011-03-17)
    Type of Medium: Online Resource
    ISSN: 0163-5964
    URL: Article
    DOI: 10.1145/3262860
    RVK:
    SS 1985
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2011
    detail.hit.zdb_id: 2088489-8
    detail.hit.zdb_id: 186012-4
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 4
    Online Resource
    Online Resource
    STABILIZER : statistically sound performance evaluation
    Association for Computing Machinery (ACM) ; 2013
    In:  ACM SIGARCH Computer Architecture News Vol. 41, No. 1 ( 2013-03-29), p. 219-228
    Details
    In: ACM SIGARCH Computer Architecture News, Association for Computing Machinery (ACM), Vol. 41, No. 1 ( 2013-03-29), p. 219-228
    Abstract: Researchers and software developers require effective performance evaluation. Researchers must evaluate optimizations or measure overhead. Software developers use automatic performance regression tests to discover when changes improve or degrade performance. The standard methodology is to compare execution times before and after applying changes. Unfortunately, modern architectural features make this approach unsound. Statistically sound evaluation requires multiple samples to test whether one can or cannot (with high confidence) reject the null hypothesis that results are the same before and after. However, caches and branch predictors make performance dependent on machine-specific parameters and the exact layout of code, stack frames, and heap objects. A single binary constitutes just one sample from the space of program layouts, regardless of the number of runs. Since compiler optimizations and code changes also alter layout, it is currently impossible to distinguish the impact of an optimization from that of its layout effects. This paper presents Stabilizer, a system that enables the use of the powerful statistical techniques required for sound performance evaluation on modern architectures. Stabilizer forces executions to sample the space of memory configurations by repeatedly re-randomizing layouts of code, stack, and heap objects at runtime. Stabilizer thus makes it possible to control for layout effects. Re-randomization also ensures that layout effects follow a Gaussian distribution, enabling the use of statistical tests like ANOVA. We demonstrate Stabilizer's efficiency ( 〈 7% median overhead) and its effectiveness by evaluating the impact of LLVM's optimizations on the SPEC CPU2006 benchmark suite. We find that, while -O2 has a significant impact relative to -O1, the performance impact of -O3 over -O2 optimizations is indistinguishable from random noise.
    Type of Medium: Online Resource
    ISSN: 0163-5964
    URL: Article
    DOI: 10.1145/2490301.2451141
    RVK:
    SS 1985
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2013
    detail.hit.zdb_id: 2088489-8
    detail.hit.zdb_id: 186012-4
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 5
    Online Resource
    Online Resource
    Archipelago : trading address space for reliability and security
    Association for Computing Machinery (ACM) ; 2008
    In:  ACM SIGARCH Computer Architecture News Vol. 36, No. 1 ( 2008-03-25), p. 115-124
    Details
    In: ACM SIGARCH Computer Architecture News, Association for Computing Machinery (ACM), Vol. 36, No. 1 ( 2008-03-25), p. 115-124
    Abstract: Memory errors are a notorious source of security vulnerabilities that can lead to service interruptions, information leakage and unauthorized access. Because such errors are also difficult to debug, the absence of timely patches can leave users vulnerable to attack for long periods of time. A variety of approaches have been introduced to combat these errors, but these often incur large runtime overheads and generally abort on errors, threatening availability. This paper presents Archipelago, a runtime system that takes advantage of available address space to substantially reduce the likelihood that a memory error will affect program execution. Archipelago randomly allocates heap objects far apart in virtual address space, effectively isolating each object from buffer overflows. Archipelago also protects against dangling pointer errors by preserving the contents of freed objects after they are freed. Archipelago thus trades virtual address space---a plentiful resource on 64-bit systems---for significantly improved program reliability and security, while limiting physical memory consumption by tracking the working set of an application and compacting cold objects. We show that Archipelago allows applications to continue to run correctly in the face of thousands of memory errors. Across a suite of server applications, Archipelago's performance overhead is 6% on average (between -7% and 22%), making it especially suitable to protect servers that have known security vulnerabilities due to heap memory errors.
    Type of Medium: Online Resource
    ISSN: 0163-5964
    URL: Article
    DOI: 10.1145/1353534.1346296
    RVK:
    SS 1985
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2008
    detail.hit.zdb_id: 2088489-8
    detail.hit.zdb_id: 186012-4
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 6
    Online Resource
    Online Resource
    Session details: Session 4B: Reliability
    Association for Computing Machinery (ACM) ; 2015
    In:  ACM SIGARCH Computer Architecture News Vol. 43, No. 1 ( 2015-05-29)
    Details
    In: ACM SIGARCH Computer Architecture News, Association for Computing Machinery (ACM), Vol. 43, No. 1 ( 2015-05-29)
    Type of Medium: Online Resource
    ISSN: 0163-5964
    URL: Article
    DOI: 10.1145/3261619
    RVK:
    SS 1985
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2015
    detail.hit.zdb_id: 2088489-8
    detail.hit.zdb_id: 186012-4
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 7
    Online Resource
    Online Resource
    Simulating believable forward accelerations on a stewart motion platform
    Association for Computing Machinery (ACM) ; 2010
    In:  ACM Transactions on Applied Perception Vol. 7, No. 1 ( 2010-01), p. 1-27
    Details
    In: ACM Transactions on Applied Perception, Association for Computing Machinery (ACM), Vol. 7, No. 1 ( 2010-01), p. 1-27
    Abstract: It is still an unsolved problem how to optimally simulate self-motion using motion simulators. We investigated how a forward acceleration can be simulated as believably as possible on a hexapod motion platform equipped with a projection screen. Human participants rated the believability of brief forward accelerations. These were simulated as visual forward accelerations over a ground plane with people as size cues, presented together with brief forward surge translations and backward pitches of the platform, and synchronous random up--down movements of the camera in the visual scene and the platform. The magnitudes of all of the parameters were varied independently across trials. Even though variability between participants was high, the most believable simulation occurred when visual accelerations were combined with backward pitches of the platform, which changed the gravitoinertial vector direction approximately consistent with the visual acceleration. However, a wide range of platform pitches was accepted as believable. With high visual acceleration cues most participants reported trials as realistic even when the platform tilt rate was above vestibular canal thresholds reported in other works. Other manipulated parameters had only a mild influence on the responses. These results can be used to optimize motion-cueing algorithms for simulating linear accelerations in motion simulators.
    Type of Medium: Online Resource
    ISSN: 1544-3558 , 1544-3965
    URL: Article
    DOI: 10.1145/1658349.1658354
    RVK:
    ST 320
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2010
    detail.hit.zdb_id: 2155384-1
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages