Person

Philip Brisk

This person is no longer with EPFL

Related publications (33)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Philip Brisk

Graph Chatbot

Chat with Graph Search

Reducing the Pressure on Routing Resources of FPGAs with Generic Logic Chains

Improving FPGA Performance for Carry-Save Arithmetic

An Optimal Linear-Time Algorithm for Interprocedural Register Allocation in High Level Synthesis Using SSA Form

Virtual Ways: Efficient Coherence for Architecturally Visible Storage in Automatic Instruction Set Extensions

Fast, Nearly Optimal ISE Identification with I/O Serialization through Maximal Clique Enumeration

Arithmetic Optimization for Custom Instruction Set Synthesis

MPSoC Design using Application-Specific Architecturally Visible Communication

Memory Organization and Data Layout for Instruction Set Extensions with Architecturally Visible Storage

Way Stealing: Cache-assisted Automatic Instruction Set Extensions

Exploiting Fast Carry-Chains Of Fpgas For Designing Compressor Trees