Search Results for "memory" - Page 71
Sort By:
Showing 2497 open source projects for "memory"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
1
WigMaker
make wiggle file from bed file for ChIP-seq samples
This application takes bed file(or gzip bed, with .gz extension) as input, it creats a single file or a fold like 'wigs for xxx' in which the chromosome separated wiggle files will be saved. Users can set the wigextend value and step value for the output wig files. By default, they are 200 and 25. The application requires a lot of memory (about 2GB) -
2
VisualStudio_Scan
VisualStudio plugin for static analysis of C/C++ code.
...Not depending on compilers enables it to find potential quality issues efficiently (100,000 line per minute). It can find critical issues such as null pointer dereference, memory leaks, buffer overrun, and logic errors -
3
WinDbgTool
Simplify managed dumps analysis.
Application acts as a host for Debugging Tools for Windows (WinDbg). Analysing memory dumps using WinDbg is rather complex in some cases. Tool is intended to automate such analysis for managed application dumps. WinDbgTool is also able to parse some WinDbg commands output and display results not using plain text but via grid control which can filter and sort data. -
4
ViennaCLBench
OpenCL linear algebra benchmark GUI for CPUs, GPUs, and MIC
ViennaCLBench provides a graphical user interface for collecting benchmark data for common OpenCL-accelerated linear algebra operations as implemented in the linear algebra library ViennaCL. -
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
5
Core Analyzer
A power tool to debug core dump, memory corruption, optimized code.
...By parsing a core dump file or a live process's memory, core analyzer is able to scan the target's heap data for memory corruption, search the whole address space for data object's references, or analyze memory pattern. It is thorough, labor-free, and insightful. I use the tool on daily basis and it is proved to be invaluable to debug many tough issues. The tool supports x86_64 architecture including Windows/RedHat/SUSE/MacOSX (32-bit and 64-bit). -
6
Lingo24 Premium MT Plugin for OmegaT
OmegaT plugin for Lingo24 Premium MT API
This project contains a plugin for the OmegaT translation memory tool to allow it to source machine translation options from the Lingo24 Premium Machine Translation API, taking advantage of their dedicated vertical engines. -
7
mpz_aprcl32
MPZ APRCL32 can prove the primality of numbers, written in C and GMP.
...It is a conversion of the Java based APRT-CLE written by Dario Alpern, who had written his based on the UBASIC version from Yuji Kida. This version incorporates improvements based on Jason Moxham's APR-CL code, which greatly reduced run-time memory requirements. mpz_aprcl is meant to be compiled on systems that support C, GMP, and a 64-bit data type. It can prove the primality of numbers up to 6021 digits long. mpz_aprcl32 is meant to be compiled on systems that support C, GMP, a 32-bit data type, but no 64-bit data type. This project can prove the primality of numbers up to 3827 digits long. ... -
8
mpz_aprcl
MPZ APRCL can prove the primality of numbers, written in C and GMP.
...It is a conversion of the Java based APRT-CLE written by Dario Alpern, who had written his based on the UBASIC version from Yuji Kida. This version incorporates improvements based on Jason Moxham's APR-CL code, which greatly reduced run-time memory requirements. mpz_aprcl is meant to be compiled on systems that support C, GMP, and a 64-bit data type. It can prove the primality of numbers up to 6021 digits long. mpz_aprcl32 is meant to be compiled on systems that support C, GMP, a 32-bit data type, but no 64-bit data type. This project can prove the primality of numbers up to 3827 digits long. ... -
9
mapgraph
Massively Parallel Graph processing on GPUs -- now part of Blazegraph
Mapgraph is SYSTAP’s disruptive new technology to exploit the main memory bandwidth advantages of GPUs. The early work was co-developed with the University of Utah SCI Institute and has its pedigree in the UINTAH software running on over 750M cores on the TITAN Super Computer. Today, SYSTAP has commercialized this technology into it’s Blazegraph Accelerator and Blazegraph HPC products. Checkout our options for GPU acceleration of graphs or contact us to learn more: https://www.blazegraph.com/product/gpu-accelerated/. ... -
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
10
Immutable Sparse Wave Trees (WaveTree)
Realtime bigdata tool for bit strings up to 2^63 based on AVL forest
Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all of that as Bits, subranges of them, and ints for sizes of its parts. ... -
11
MiniLisp
A readable lisp in less than 1k lines of C
...It includes support for lexical scoping, user-defined functions, and a macro system, enabling users to explore advanced Lisp concepts. The interpreter also implements a copying garbage collector, demonstrating memory management techniques in a simple context. It is designed to run on Unix-like systems and includes a test suite for validation. -
12
deapheap
Deap is a doubly heap for both min and max number access.
...It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small. -
13
STMX
High-performance transactional memory for Common Lisp
STMX is a high-performance Common Lisp library for composable Transactional Memory (TM), a concurrency control mechanism aimed at making concurrent programming easier to write and understand. Instead of traditional lock-based programming, one programs with atomic memory transactions: if a memory transaction returns normally it gets committed, if instead it signals an error (Lisp slang for throwing an exception) it is rolled back. -
14
UFFS: Ultra-low-cost Flash File System, designed for NAND flash working in embedded system. UFFS typically consumes less then 200K ram for 1Gb(page 512)/4Gb(page 2K) NAND flash. It supports direct flash interface, works with or without OS.
-
15
MemoryGame Java RMI
By using Java RMI to develop a Memory Game.
This game was developed by using Java RMI(Remote Method Invocation). This game allow two computers in the same network play against each other with same synchronize screen. Every movement is seen by each other. This project was developed by the author for submitting the final assignment of software development course. Note: In order to make this project runnable you need to have eclipse installed and also install Java RMI plugin. -
16
Raspberry Pi based Honeypots
Raspbian with pre-installed kippo, dionaea and glastopf honeypots
...Pi-pots are pre-loaded raspberry pi images and contain various honeypot clients (like kippo, dionaea and glastopf) and other softwares needed to run a honeypot sensor. A user may simply download these raspbian distributions and write it to the memory card. They can then setup a sensor in no time. Different versions of pi-pots bundle different software required by a sensor. Users are encouraged to go through the readme file for each version to best meet their requirements. -
17
OutView
Analyze output files of SAP NetWeaver Java application server
Analyze output files of SAP NetWeaver Java application server. Load std_serverX.out files from the application server's work folder and display garbage collection statistics, heap memory usage characteristics and more. -
18
A lightweight library that retrieves statistics of the system's activity in a portable and thread safe way. In each OS that it supports it offers the same API for retrieving the activity of: hard disks, CPUs, memory, processes and network interfaces
-
19
Cognitive Stability and Flexibility FIT
GPU Accelerated Fitting of Behavioral Data by a Physiological Model
Using the NVIDIA-CUDA framework, mcmc_min is able to efficiently sample the Bayesian posterior distribution over the parameters of a physiologically derived model of a task-switching and distractor inhibition paradigm. The model features a working-memory module, implementing the currently active task rule in terms of a two-dimensional stochastic dynamical system with three attractor states (rule 1, rule 2, spontaneous). The working memory module is given inputs representing the task cue in the simulated paradigm and the activity of the rule 1 versus rule 2 representing population biases a decision module. ... -
20
Modabi
Modabi is a Modular Data Binding system for Java
Modabi is a Modular Data Binding library for Java, which aims to provide users with the most flexible and comprehensive feature set possible. Modabi can be used to provide mappings between Java objects in memory and a number of formats, including Yaml and XML, without any modification to existing business objects. Check out the wiki for a more in depth examination of the features of Modabi. -
21
libshmht
Shared memory hash table for cache pourposes.
Hash table in shared memory. Specifically developed to be used as a cache. -
22
OptimC
OptimC - Optimization / Unconstrained Minimization Library in ANSI C
OptimC is a C software package to minimize any unconstrained multivariable function. The algorithms implemented are Nelder-Mead,Newton Methods (Line Search and Trust Region methods), Conjugate Gradient and BFGS (regular and Limited Memory). Brent method is also available for single variable functions if the bounds are known. Update 06/09/2014 - Nonlinear Squares Implementation [Levenberg-Marquardt Method] Added. Documentation - http://code.google.com/p/optimc/ -
23
Intel(R) CnC
Parallelism without the Pain
...Intel© Concurrent Collections for C++ is a C++ template library for letting C++ programmers implement CnC applications which run in parallel on shared and distributed memory. -
24
Live MP3/OGG/AAC Flash Player for Icecast and Shoutcast. It has some interesting and necessary features like reconnect on network errors to make sure users never get silence and cache management to avoid memory memory consumption. Works with Flash 10.1 and newer.
-
25
Audio Game Kit
a game library to develop audio games
do you want to make your audio game? it is easy! just embed AGK in your C++ application and use it it is very easy to learn
